Abstract
The notion of Δ30-categoricity in linear orderings and Boolean algebras is examined. We provide a proof for the fact that there are uncountably many relatively Δ30-categorical linear orderings, and furnish a proof of another fact which suggests that the (unrelatively) Δ30-categorical linear orderings may be very difficult to classify. In stark contrast to these results for linear orderings, a complete classification of the relatively Δ30-categorical Boolean algebras is given.
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 callDisclaimer: 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.
