Abstract
We introduce and study simple and supersimple independence relations in the context of AECs with a monster model.Theorem 0.1LetKbe an AEC with a monster model.•IfKhas a simple independence relation, thenKdoes not have the 2-tree property.•IfKhas a simple independence relation with the(<ℵ0)-witness property for singletons, thenKdoes not have the tree property.The proof of both facts is done by finding cardinal bounds to classes of small Galois-types over a fixed model that are inconsistent for large subsets. We think that this finer way of counting types is an interesting notion in itself.We characterize supersimple independence relations by finiteness of the Lascar rank under locality assumptions on the independence relation.
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.
