We introduce the framework of AECats (abstract elementary categories), generalising both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory ("cat", as introduced by Ben-Yaacov) forms an AECat. In particular, we find applications in positive logic and continuous logic: the category of (subsets of) models of a positive or continuous theory is an AECat. The Kim-Pillay theorem for first-order logic characterises simple theories by the properties dividing independence has. We prove a version of the Kim-Pillay theorem for AECats with the amalgamation property, generalising the first-order version and existing versions for positive logic.
An important dividing line in the class of unstable theories is being NSOP 1 , which is more general than being simple. In NSOP 1 theories forking independence may not be as well behaved as in stable or simple theories, so it is replaced by another independence notion, called Kim-independence. We generalise Kim-independence over models in NSOP 1 theories to positive logic -a proper generalisation of full first-order logic where negation is not built in, but can be added as desired. For example, an important application is that we can add hyperimaginary sorts to a positive theory to get another positive theory, preserving NSOP 1 and various other properties. We prove that, in a thick positive NSOP 1 theory, Kim-independence over existentially closed models has all the nice properties that it is known to have in an NSOP 1 theory in full first-order logic. We also provide a Kim-Pillay style theorem, characterising which thick positive theories are NSOP 1 by the existence of a certain independence relation. Furthermore, this independence relation must then be the same as Kim-independence. Thickness is the mild assumption that being an indiscernible sequence is type-definable.In full first-order logic Kim-independence is defined in terms of Morley sequences in global invariant types. These may not exist in thick positive theories. We solve this by working with Morley sequences in global Lascar-invariant types, which do exist in thick positive theories. We also simplify certain tree constructions that were used in the study of Kim-independence in full first-order logic. In particular, we only work with trees of finite height. 65 4. Kim-dividing 70 5. EM-modelling and parallel-Morley sequences 74 6. Symmetry 81 7. Independence theorem 84 8. Transitivity 94 9. Kim-Pillay style theorem 96 10. Examples 101 Acknowledgements 111 References 111 MSC2020: 03C10, 03C45.
The classes stable, simple and NSOP 1 in the stability hierarchy for first-order theories can be characterised by the existence of a certain independence relation. For each of them there is a canonicity theorem: there can be at most one nice independence relation. Independence in stable and simple first-order theories must come from forking and dividing (which then coincide), and for NSOP 1 theories it must come from Kim-dividing.We generalise this work to the framework of AECats (Abstract Elementary Categories) with the amalgamation property. These are a certain kind of accessible category generalising the category of (subsets of) models of some theory. We prove canonicity theorems for stable, simple and NSOP 1 -like independence relations. The stable and simple cases have been done before in slightly different setups, but we provide them here as well so that we can recover part of the original stability hierarchy. We also provide abstract definitions for each of these independence relations as what we call isi-dividing, isi-forking and long Kim-dividing.
We construct a 2-equivalence $$\mathfrak {CohTheory}^{op }\simeq \mathfrak {TypeSpaceFunc}$$ CohTheory op ≃ TypeSpaceFunc . Here $$\mathfrak {CohTheory}$$ CohTheory is the 2-category of positive theories and $$\mathfrak {TypeSpaceFunc}$$ TypeSpaceFunc is the 2-category of type space functors. We give a precise definition of interpretations for positive logic, which will be the 1-cells in $$\mathfrak {CohTheory}$$ CohTheory . The 2-cells are definable homomorphisms. The 2-equivalence restricts to a duality of categories, making precise the philosophy that a theory is ‘the same’ as the collection of its type spaces (i.e. its type space functor). In characterising those functors that arise as type space functors, we find that they are specific instances of (coherent) hyperdoctrines. This connects two different schools of thought on the logical structure of a theory. The key ingredient, the Deligne completeness theorem, arises from topos theory, where positive theories have been studied under the name of coherent theories.
We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical frameworks. First we take a category-theoretic approach, which requires very little set-up. We show that linear independence forms a simple unstable independence relation. With some more work we then show that we can also work in the framework of positive logic, which is much more powerful than the category-theoretic approach and much closer to the classical framework of full first-order logic. We fully characterise the existentially closed models of the arising positive theory. Using the independence relation from before we conclude that the theory is simple unstable, in the sense that dividing has local character but there are many distinct types.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.