Switch to: References

Add citations

You must login to add citations.
  1. Super/rosy L k -theories and classes of finite structures.Cameron Donnay Hill - 2013 - Annals of Pure and Applied Logic 164 (10):907-927.
    We recover the essentials of þ-forking, rosiness and super-rosiness for certain amalgamation classes K, and thence of finite-variable theories of finite structures. This provides a foundation for a model-theoretic analysis of a natural extension of the “LkLk-Canonization Problem” – the possibility of efficiently recovering finite models of T given a finite presentation of an LkLk-theory T. Some of this work is accomplished through different sorts of “transfer” theorem to the first-order theory TlimTlim of the direct limit. Our results include, to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Indiscernible Extraction and Morley Sequences.Sebastien Vasey - 2017 - Notre Dame Journal of Formal Logic 58 (1):127-132.
    We present a new proof of the existence of Morley sequences in simple theories. We avoid using the Erdős–Rado theorem and instead use only Ramsey’s theorem and compactness. The proof shows that the basic theory of forking in simple theories can be developed using only principles from “ordinary mathematics,” answering a question of Grossberg, Iovino, and Lessmann, as well as a question of Baldwin.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Formalism Freeness: Implementing Gödel's 1946 Princeton Bicentennial Lecture.Juliette Kennedy - 2013 - Bulletin of Symbolic Logic 19 (3):351-393.
    In this paper we isolate a notion that we call “formalism freeness” from Gödel's 1946 Princeton Bicentennial Lecture, which asks for a transfer of the Turing analysis of computability to the cases of definability and provability. We suggest an implementation of Gödel's idea in the case of definability, via versions of the constructible hierarchy based on fragments of second order logic. We also trace the notion of formalism freeness in the very wide context of developments in mathematical logic in the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • A geometric introduction to forking and thorn-forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):1-20.
    A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   41 citations  
  • Forking, imaginaries, and other features of.Christian D’elbée - 2021 - Journal of Symbolic Logic 86 (2):669-700.
    We study the generic theory of algebraically closed fields of fixed positive characteristic with a predicate for an additive subgroup, called $\mathrm {ACFG}$. This theory was introduced in [16] as a new example of $\mathrm {NSOP}_{1}$ nonsimple theory. In this paper we describe more features of $\mathrm {ACFG}$, such as imaginaries. We also study various independence relations in $\mathrm {ACFG}$, such as Kim-independence or forking independence, and describe interactions between them.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Canonical forking in AECs.Will Boney, Rami Grossberg, Alexei Kolesnikov & Sebastien Vasey - 2016 - Annals of Pure and Applied Logic 167 (7):590-613.
  • Independence in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2019 - Journal of Mathematical Logic 19 (1):1950005.
    The randomization of a complete first-order theory [Formula: see text] is the complete continuous theory [Formula: see text] with two sorts, a sort for random elements of models of [Formula: see text] and a sort for events in an underlying atomless probability space. We study independence relations and related ternary relations on the randomization of [Formula: see text]. We show that if [Formula: see text] has the exchange property and [Formula: see text], then [Formula: see text] has a strict independence (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • An introduction to theories without the independence property.Hans Adler - unknown
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations