Switch to: References

Add citations

You must login to add citations.
  1. The elementary diagram of a trivial, weakly minimal structure is near model complete.Michael C. Laskowski - 2009 - Archive for Mathematical Logic 48 (1):15-24.
    We prove that if M is any model of a trivial, weakly minimal theory, then the elementary diagram T(M) eliminates quantifiers down to Boolean combinations of certain existential formulas.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Supersimple structures with a dense independent subset.Alexander Berenstein, Juan Felipe Carmona & Evgueni Vassiliev - 2017 - Mathematical Logic Quarterly 63 (6):552-573.
    Based on the work done in [][] in the o‐minimal and geometric settings, we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forking‐independent elements that is dense inside a partial type, which we call H‐structures. We show that any two such expansions have the same theory and that under some technical conditions, the saturated models of this common theory are again H‐structures. We prove that under these assumptions the expansion is supersimple and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Weakly minimal groups with a new predicate.Gabriel Conant & Michael C. Laskowski - 2020 - Journal of Mathematical Logic 20 (2):2050011.
    Fix a weakly minimal (i.e. superstable U-rank 1) structure M. Let M∗ be an expansion by constants for an elementary substructure, and let A be an arbitrary subset of the universe M. We show that all formulas in the expansion (M∗,A) are equivalent to bounded formulas, and so (M,A) is stable (or NIP) if and only if the M-induced structure AM on A is stable (or NIP). We then restrict to the case that M is a pure abelian group with (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Binary simple homogeneous structures.Vera Koponen - 2018 - Annals of Pure and Applied Logic 169 (12):1335-1368.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Triviality, NDOP and stable varieties.B. Hart, A. Pillay & S. Starchenko - 1993 - Annals of Pure and Applied Logic 62 (2):119-146.
    We study perfectly trivial theories, 1-based theories, stable varieties, and their mutual interaction. We give a structure theorem for the models of a complete perfectly trivial stable theory without DOP: any model is the algebraic closure of a nonforking regular tree of elements. We also give a structure theorem for stable varieties, all of whose completions have NDOP. Such a variety is a varietal product of an affine variety and a combinatorial variety of an especially simple form.
    Download  
     
    Export citation  
     
    Bookmark  
  • Ample dividing.David M. Evans - 2003 - Journal of Symbolic Logic 68 (4):1385-1402.
    We construct a stable one-based, trivial theory with a reduct which is not trivial. This answers a question of John B. Goode. Using this, we construct a stable theory which is n-ample for all natural numbers n, and does not interpret an infinite group.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Supersimple ω-categorical theories and pregeometries.Vera Koponen - 2019 - Annals of Pure and Applied Logic 170 (12):102718.
    Download  
     
    Export citation  
     
    Bookmark  
  • Distality Rank.Roland Walker - 2023 - Journal of Symbolic Logic 88 (2):704-737.
    Building on Pierre Simon’s notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rankmsuch that$1\leq m \leq \omega $. For NIP theories, we show that distality rank is invariant under base change. We also define a generalization of type orthogonality calledm-determinacy and show that theories of distality rankmrequire certain products to bem-determined. Furthermore, for NIP theories, this behavior characterizesm-distality. If we narrow the scope to stable theories, we observe thatm-distality can be (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Countable models of 1-based theories.Anand Pillay - 1992 - Archive for Mathematical Logic 31 (3):163-169.
    Download  
     
    Export citation  
     
    Bookmark   5 citations