Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Forcing isomorphism II.M. C. Laskowski & S. Shelah - 1996 - Journal of Symbolic Logic 61 (4):1305-1320.
    If T has only countably many complete types, yet has a type of infinite multiplicity then there is a c.c.c. forcing notion Q such that, in any Q-generic extension of the universe, there are non-isomorphic models M 1 and M 2 of T that can be forced isomorphic by a c.c.c. forcing. We give examples showing that the hypothesis on the number of complete types is necessary and what happens if `c.c.c.' is replaced by other cardinal-preserving adjectives. We also give (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Strongly determined types.Alexandre A. Ivanov & Dugald Macpherson - 1999 - Annals of Pure and Applied Logic 99 (1-3):197-230.
    The notion of a strongly determined type over A extending p is introduced, where p .S. A strongly determined extension of p over A assigns, for any model M )- A, a type q S extending p such that, if realises q, then any elementary partial map M → M which fixes acleq pointwise is elementary over . This gives a crude notion of independence which arises very frequently. Examples are provided of many different kinds of theories with strongly determined (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)Main gap for locally saturated elementary submodels of a homogeneous structure.Tapani Hyttinen & Saharon Shelah - 2001 - Journal of Symbolic Logic 66 (3):1286-1302.
    We prove a main gap theorem for locally saturated submodels of a homogeneous structure. We also study the number of locally saturated models, which are not elementarily embeddable into each other.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Main gap for locally saturated elementary submodels of a homogeneous structure.Tapani Hyttinen & Saharon Shelah - 2001 - Journal of Symbolic Logic 66 (3):1286-1302.
    We prove a main gap theorem for locally saturated submodels of a homogeneous structure. We also study the number of locally saturated models, which are not elementarily embeddable into each other.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Stable theories without dense forking chains.Bernhard Herwig, James G. Loveys, Anand Pillay, Predag Tanović & O. Wagner - 1992 - Archive for Mathematical Logic 31 (5):297-303.
    We define a generalized notion of rank for stable theories without dense forking chains, and use it to derive that every type is domination-equivalent to a finite product of regular types. We apply this to show that in a small theory admitting finite coding, no realisation of a nonforking extension of some strong type can be algebraic over some realisation of a forking extension.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)A note on a-prime models.Bradd Hart, Željko Sokolović & Predrag Tanovic - 1999 - Journal of Symbolic Logic 64 (4):1557-1562.
    We answer a question of Cassidy and Kolchin about the universality of the constrained closure of a differential field by working in a larger category of models.
    Download  
     
    Export citation  
     
    Bookmark  
  • There is no sharp transitivity on q 6 when q is a type of Morley rank 2.Ursula Gropp - 1992 - Journal of Symbolic Logic 57 (4):1198-1212.
    Download  
     
    Export citation  
     
    Bookmark  
  • An Invitation to Extension Domination.Kyle Gannon & Jinhe Ye - 2023 - Notre Dame Journal of Formal Logic 64 (3):253-280.
    Motivated by the theory of domination for types, we introduce a notion of domination for Keisler measures called extension domination. We argue that this variant of domination behaves similarly to its typesetting counterpart. We prove that extension domination extends domination for types and that it forms a preorder on the space of global Keisler measures. We then explore some basic properties related to this notion (e.g., approximations by formulas, closure under localizations, convex combinations). We also prove a few preservation theorems (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Une fonction de Kolchin pour les corps imparfaits de degré d'imperfection fini.Françoise Delon - 2005 - Journal of Symbolic Logic 70 (2):664 - 680.
    Non-perfect separably closed fields are stable, and not superstable. As a result, not all types can be ranked. We develop here a new tool, a "semi-rank", which takes values in the non-negative reals, and gives a sufficient condition for forking of types. This semi-rank is built up from a transcendence function, analogous to the one considered by Kolchin in the context of differentially closed fields. It yields some orthogonality and stratification results. /// Un corps séparablement clos non algébriquement clos est (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Heirs of Box Types in Polynomially Bounded Structures.Marcus Tressl - 2009 - Journal of Symbolic Logic 74 (4):1225 - 1263.
    A box type is an n-type of an o-minimal structure which is uniquely determined by the projections to the coordinate axes. We characterize heirs of box types of a polynomially bounded o-minimal structure M. From this, we deduce various structure theorems for subsets of $M^k $ , definable in the expansion M of M by all convex subsets of the line. We show that M after naming constants, is model complete provided M is model complete.
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)Modèles saturés et modèles engendrés Par Des indiscernables.Benoît Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.
    In the early eighties, answering a question of A. Macintyre, J. H. Schmerl ([13]) proved that every countable recursively saturated structure, equipped with a function β encoding the finite functions, is the β-closure of an infinite indiscernible sequence. This result implies that every countably saturated structure, in a countable but not necessarily recursive language, is an Ehrenfeucht-Mostowski model, by which we mean that the structure expands, in a countable language, to the Skolem hull of an infinite indiscernible sequence (in the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On the number of nonisomorphic models of size |t|.Ambar Chowdhury - 1994 - Journal of Symbolic Logic 59 (1):41 - 59.
    Let T be an uncountable, superstable theory. In this paper we prove Theorem A. If T has finite rank, then I(|T|, T) ≥ ℵ0. Theorem B. If T is trivial, then I(|T|, T) ≥ ℵ0.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (2 other versions)From "metabelian q-vector spaces" to new ω-stable groups.Olivier Chapuis - 1996 - Bulletin of Symbolic Logic 2 (1):84-93.
    The aim of this paper is to describe an analogue of the theory of nontrivial torsion-free divisible abelian groups for metabelian groups. We obtain illustrations for “old-fashioned” model theoretic algebra and “new” examples in the theory of stable groups. We begin this paper with general considerations about model theory. In the second section we present our results and we give the structure of the rest of the paper. Most parts of this paper use only basic concepts from model theory and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (2 other versions)From “Metabelian ℚ-Vector Spaces” to New ω-Stable Groups.Olivier Chapuis - 1996 - Bulletin of Symbolic Logic 2 (1):84-93.
    The aim of this paper is to describe (without proofs) an analogue of the theory of nontrivial torsion-free divisible abelian groups for metabelian groups. We obtain illustrations for “old-fashioned” model theoretic algebra and “new” examples in the theory of stable groups. We begin this paper with general considerations about model theory. In the second section we present our results and we give the structure of the rest of the paper. Most parts of this paper use only basic concepts from model (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)From "Metabelian $text{Q}$-Vector Spaces" to New $omega $-Stable Groups.Olivier Chapuis - 1996 - Bulletin of Symbolic Logic 2 (1):84-93.
    The aim of this paper is to describe an analogue of the theory of nontrivial torsion-free divisible abelian groups for metabelian groups. We obtain illustrations for “old-fashioned” model theoretic algebra and “new” examples in the theory of stable groups. We begin this paper with general considerations about model theory. In the second section we present our results and we give the structure of the rest of the paper. Most parts of this paper use only basic concepts from model theory and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A construction of superstable NDOP-NOTOP groups.Andreas Baudisch - 1991 - Journal of Symbolic Logic 56 (4):1385-1390.
    The paper continues [1]. Let S be a complete theory of ultraflat (e.g. planar) graphs as introduced in [4]. We show a strong form of NOTOP for S: The union of two models M1 and M2, independent over a common elementary submodel M0, is the primary model over M1 ∪ M2 of S. Then by results of [1] Mekler's construction [6] gives for such a theory S of nice ultraflat graphs a superstable 2-step-nilpotent group of exponent $p (>2)$ with NDOP (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Local homogeneity.Bektur Baizhanov & John T. Baldwin - 2004 - Journal of Symbolic Logic 69 (4):1243-1260.
    We study the expansion of stable structures by adding predicates for arbitrary subsets. Generalizing work of Poizat-Bouscaren on the one hand and Baldwin-Benedikt-Casanovas-Ziegler on the other we provide a sufficient condition for such an expansion to be stable. This generalization weakens the original definitions in two ways: dealing with arbitrary subsets rather than just submodels and removing the ‘small' or ‘belles paires' hypothesis. We use this generalization to characterize in terms of pairs, the ‘triviality' of the geometry on a strongly (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Definable sets in Boolean-ordered o-minimal structures. I.Ludomir Newelski & Roman Wencel - 2001 - Journal of Symbolic Logic 66 (4):1821-1836.
    We prove weak elimination of imaginary elements for Boolean orderings with finitely many atoms. As a consequence we obtain equivalence of the two notions of o-minimality for Boolean ordered structures, introduced by C. Toffalori. We investigate atoms in Boolean algebras induced by algebraically closed subsets of Boolean ordered structures. We prove uniqueness of prime models in strongly o-minimal theories of Boolean ordered structures.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)The model theory of differential fields with finitely many commuting derivations.Tracey McGrail - 2000 - Journal of Symbolic Logic 65 (2):885-913.
    In this paper we set out the basic model theory of differential fields of characteristic 0, which have finitely many commuting derivations. We give axioms for the theory of differentially closed differential fields with m derivations and show that this theory is ω-stable, model complete, and quantifier-eliminable, and that it admits elimination of imaginaries. We give a characterization of forking and compute the rank of this theory to be ω m + 1.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Weak Heirs, Coheirs, and the Ellis Semigroups.Adam Malinowski & Ludomir Newelski - forthcoming - Journal of Symbolic Logic:1-22.
    Assume$G\prec H$are groups and${\cal A}\subseteq {\cal P}(G),\ {\cal B}\subseteq {\cal P}(H)$are algebras of sets closed under left group translation. Under some additional assumptions we find algebraic connections between the Ellis [semi]groups of theG-flow$S({\cal A})$and theH-flow$S({\cal B})$. We apply these results in the model theoretic context. Namely, assumeGis a group definable in a modelMand$M\prec ^* N$. Using weak heirs and weak coheirs we point out some algebraic connections between the Ellis semigroups$S_{ext,G}(M)$and$S_{ext,G}(N)$. Assuming every minimal left ideal in$S_{ext,G}(N)$is a group we prove (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Generically stable regular types.Predrag Tanović - 2015 - Journal of Symbolic Logic 80 (1):308-321.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Saturated Free Algebras Revisited.Anand Pillay & Rizos Sklinos - 2015 - Bulletin of Symbolic Logic 21 (3):306-318.
    We give an exposition of results of Baldwin–Shelah [2] on saturated free algebras, at the level of generality of complete first order theoriesTwith a saturated modelMwhich is in the algebraic closure of an indiscernible set. We then make some new observations whenM isa saturated free algebra, analogous to (more difficult) results for the free group, such as a description of forking.
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)Raising to powers revisited.Boris Zilber - 2005 - Annals of Pure and Applied Logic 132 (1):67-95.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Analytic Zariski structures and the Hrushovski construction.Nick Peatfield & Boris Zilber - 2005 - Annals of Pure and Applied Logic 132 (2):127-180.
    A set of axioms is presented defining an ‘analytic Zariski structure’, as a generalisation of Hrushovski and Zilber’s Zariski structures. Some consequences of the axioms are explored. A simple example of a structure constructed using Hrushovski’s method of free amalgamation is shown to be a non-trivial example of an analytic Zariski structure. A number of ‘quasi-analytic’ results are derived for this example e.g. analogues of Chow’s theorem and the proper mapping theorem.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Countable models of 1-based theories.Anand Pillay - 1992 - Archive for Mathematical Logic 31 (3):163-169.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (2 other versions)Modèles saturés et modèles engendrés par des indiscernables.Benoît Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.
    In the early eighties, answering a question of A. Macintyre, J. H. Schmerl ([13]) proved that every countable recursively saturated structure, equipped with a functionβencoding the finite functions, is theβ-closure of an infinite indiscernible sequence. This result implies that every countably saturated structure, in a countable but not necessarily recursive language, is an Ehrenfeucht-Mostowski model, by which we mean that the structureexpands, in a countable language, to the Skolem hull of an infinite indiscernible sequence (in the new language).More recently, D. (...)
    Download  
     
    Export citation  
     
    Bookmark