Switch to: Citations

Add references

You must login to add references.
  1. On model-theoretic tree properties.Artem Chernikov & Nicholas Ramsey - 2016 - Journal of Mathematical Logic 16 (2):1650009.
    We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the literature are (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Model theoretic dynamics in Galois fashion.Daniel Max Hoffmann - 2019 - Annals of Pure and Applied Logic 170 (7):755-804.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Properties of forking in {$ømega$}-free pseudo-algebraically closed fields.Zoé Chatzidakis - 2002 - Journal of Symbolic Logic 67 (3):957-996.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Stable theories with a new predicate.Enrique Casanovas & Martin Ziegler - 2001 - Journal of Symbolic Logic 66 (3):1127-1140.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Elementary equivalence theorem for Pac structures.Jan Dobrowolski, Daniel Max Hoffmann & Junguk Lee - 2020 - Journal of Symbolic Logic 85 (4):1467-1498.
    We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism type of their absolute Galois groups. Our results concern two cases: saturated PAC structures and nonsaturated PAC structures.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
    Download  
     
    Export citation  
     
    Bookmark   206 citations  
  • (1 other version)Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
    Download  
     
    Export citation  
     
    Bookmark   411 citations  
  • Generic structures and simple theories.Z. Chatzidakis & A. Pillay - 1998 - Annals of Pure and Applied Logic 95 (1-3):71-92.
    We study structures equipped with generic predicates and/or automorphisms, and show that in many cases we obtain simple theories. We also show that a bounded PAC field is simple. 1998 Published by Elsevier Science B.V. All rights reserved.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • On PAC and Bounded Substructures of a Stable Structure.Anand Pillay & Dominika Polkowska - 2006 - Journal of Symbolic Logic 71 (2):460 - 472.
    We introduce and study the notions of a PAC-substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [10]. We give precise definitions and equivalences, saying what it means for properties such as PAC to be first order, study some examples (such as differentially closed fields) in detail, relate the material to generic automorphisms, and generalize a "descent theorem" for pseudo-algebraically closed fields to the stable context. We also point out that the elementary invariants of pseudo-algebraically (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Laforte, G., see Downey, R.T. Arai, Z. Chatzidakis & A. Pillay - 1998 - Annals of Pure and Applied Logic 95 (1-3):287.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • On simplicity of bounded pseudoalgebraically closed structures.O. P. Nicholas Marie Polkowska - 2007 - Journal of Mathematical Logic 7 (2):173-193.
    Bounded PAC substructures of models of stable theory T are generalizations of bounded PAC fields and bounded PAC beautiful pairs generalize Poizat's beautiful pairs. Both notions were introduced in the authors Ph.D. thesis. In this paper, we prove that under the assumption that the PAC property is first order for T, the theory of any bounded PAC structure is simple. Moreover, if the PAC property is first order for T and T does not have the finite cover property, then the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the n-uniqueness of types in rosy theories.Byunghan Kim - 2016 - Archive for Mathematical Logic 55 (5-6):677-686.
    We prove that in a rosy theory, the n-uniqueness of a strong type p implies the strong n-uniqueness of p. In addition we study some of the boundary properties of p.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Amalgamation of types in pseudo-algebraically closed fields and applications.Zoé Chatzidakis - 2019 - Journal of Mathematical Logic 19 (2):1950006.
    This paper studies unbounded pseudo-algebraically closed fields and shows an amalgamation result for types over algebraically closed sets. It discusses various applications, for instance that omega-free PAC fields have the property NSOP3. It also contains a description of imaginaries in PAC fields.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Model Theory of Fields.D. Marker, M. Messmer & A. Pillay - 2001 - Studia Logica 67 (1):123-124.
    Download  
     
    Export citation  
     
    Bookmark   6 citations