Abstract

AbstractThis note investigates the class of finite initial segments of the cumulative hierarchy of pure sets. We show that this class is first‐order definable over the class of finite directed graphs and that this class admits a first‐order definable global linear order. We apply this last result to show that FO(<, BIT) = FO(BIT).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.