Switch to: References

Citations of:

[Omnibus Review]

Journal of Symbolic Logic 49 (1):317-321 (1984)

Add citations

You must login to add citations.
  1. 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.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  • Simple groups and the number of countable models.Predrag Tanović - 2013 - Archive for Mathematical Logic 52 (7-8):779-791.
    Let T be a complete, superstable theory with fewer than ${2^{\aleph_{0}}}$ countable models. Assuming that generic types of infinite, simple groups definable in T eq are sufficiently non-isolated we prove that ω ω is the strict upper bound for the Lascar rank of T.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • Finding generically stable measures.Pierre Simon - 2012 - Journal of Symbolic Logic 77 (1):263-278.
    This work builds on previous papers by Hrushovski, Pillay and the author where Keisler measures over NIP theories are studied. We discuss two constructions for obtaining generically stable measures in this context. First, we show how to symmetrize an arbitrary invariant measure to obtain a generically stable one from it. Next, we show that suitable sigma-additive probability measures give rise to generically stable Keisler measures. Also included is a proof that generically stable measures over o-minimal theories and the p-adics are (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Diophantine geometry from model theory.Thomas Scanlon - 2001 - Bulletin of Symbolic Logic 7 (1):37-57.
    §1. Introduction. With Hrushovski's proof of the function field Mordell-Lang conjecture [16] the relevance of geometric stability theory to diophantine geometry first came to light. A gulf between logicians and number theorists allowed for contradictory reactions. It has been asserted that Hrushovski's proof was simply an algebraic argument masked in the language of model theory. Another camp held that this theorem was merely a clever one-off. Still others regarded the argument as magical and asked whether such sorcery could unlock the (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Topological dynamics and definable groups.Anand Pillay - 2013 - Journal of Symbolic Logic 78 (2):657-666.
    We give a commentary on Newelski's suggestion or conjecture [8] that topological dynamics, in the sense of Ellis [3], applied to the action of a definable group $G(M)$ on its “external type space” $S_{G,\textit{ext}}(M)$, can explain, account for, or give rise to, the quotient $G/G^{00}$, at least for suitable groups in NIP theories. We give a positive answer for measure-stable (or $fsg$) groups in NIP theories. As part of our analysis we show the existence of “externally definable” generics of $G(M)$ (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • On countable simple unidimensional theories.Anand Pillay - 2003 - Journal of Symbolic Logic 68 (4):1377-1384.
    We prove that any countable simple unidimensional theory T is supersimple, under the additional assumptions that T eliminates hyperimaginaries and that the $D_\phi-ranks$ are finite and definable.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Compact complex manifolds with the DOP and other properties.Anand Pillay & Thomas Scanlon - 2002 - Journal of Symbolic Logic 67 (2):737-743.
    We point out that a certain complex compact manifold constructed by Lieberman has the dimensional order property, and has U-rank different from Morley rank. We also give a sufficient condition for a Kahler manifold to be totally degenerate (that is, to be an indiscernible set, in its canonical language) and point out that there are K3 surfaces which satisfy these conditions.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  • Dependence logic in pregeometries and ω-stable theories.Gianluca Paolini & Jouko Väänänen - 2016 - Journal of Symbolic Logic 81 (1):32-55.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the class of flat stable theories.Daniel Palacín & Saharon Shelah - 2018 - Annals of Pure and Applied Logic 169 (8):835-849.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Superstable Expansions of Free Abelian Groups.Daniel Palacín & Rizos Sklinos - 2018 - Notre Dame Journal of Formal Logic 59 (2):157-169.
    We prove that has no proper superstable expansions of finite Lascar rank. Nevertheless, this structure equipped with a predicate defining powers of a given natural number is superstable of Lascar rank ω. Additionally, our methods yield other superstable expansions such as equipped with the set of factorial elements.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • On definable Galois groups and the strong canonical base property.Daniel Palacín & Anand Pillay - 2017 - Journal of Mathematical Logic 17 (1):1750002.
    In [E. Hrushovski, D. Palacín and A. Pillay, On the canonical base property, Selecta Math. 19 865–877], Hrushovski and the authors proved, in a certain finite rank environment, that rigidity of definable Galois groups implies that [Formula: see text] has the canonical base property in a strong form; “internality to” being replaced by “algebraicity in”. In the current paper, we give a reasonably robust definition of the “strong canonical base property” in a rather more general finite rank context than [E. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Elimination of Hyperimaginaries and Stable Independence in Simple CM-Trivial Theories.D. Palacín & F. O. Wagner - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):541-551.
    In a simple CM-trivial theory every hyperimaginary is interbounded with a sequence of finitary hyperimaginaries. Moreover, such a theory eliminates hyperimaginaries whenever it eliminates finitary hyperimaginaries. In a supersimple CM-trivial theory, the independence relation is stable.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Ample thoughts.Daniel Palacín & Frank O. Wagner - 2013 - Journal of Symbolic Logic 78 (2):489-510.
    Non-$n$-ampleness as defined by Pillay [20] and Evans [5] is preserved under analysability. Generalizing this to a more general notion of $\Sigma$-ampleness, this gives an immediate proof for all simple theories of a weakened version of the Canonical Base Property (CBP) proven by Chatzidakis [4] for types of finite SU-rank. This is then applied to the special case of groups.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Model theory of finite and pseudofinite groups.Dugald Macpherson - 2018 - Archive for Mathematical Logic 57 (1-2):159-184.
    This is a survey, intended both for group theorists and model theorists, concerning the structure of pseudofinite groups, that is, infinite models of the first-order theory of finite groups. The focus is on concepts from stability theory and generalisations in the context of pseudofinite groups, and on the information this might provide for finite group theory.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • From stability to simplicity.Byunghan Kim & Anand Pillay - 1998 - Bulletin of Symbolic Logic 4 (1):17-36.
    §1. Introduction. In this report we wish to describe recent work on a class of first order theories first introduced by Shelah in [32], the simple theories. Major progress was made in the first author's doctoral thesis [17]. We will give a survey of this, as well as further works by the authors and others.The class of simple theories includes stable theories, but also many more, such as the theory of the random graph. Moreover, many of the theories of particular (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Remarks on unimodularity.Charlotte Kestner & Anand Pillay - 2011 - Journal of Symbolic Logic 76 (4):1453-1458.
    We clarify and correct some statements and results in the literature concerning unimodularity in the sense of Hrushovski [7], and measurability in the sense of Macpherson and Steinhorn [8], pointing out in particular that the two notions coincide for strongly minimal structures and that another property from [7] is strictly weaker, as well as "completing" Elwes' proof [5] that measurability implies 1-basedness for stable theories.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Interpretable groups in Mann pairs.Haydar Göral - 2018 - Archive for Mathematical Logic 57 (3-4):203-237.
    In this paper, we study an algebraically closed field \ expanded by two unary predicates denoting an algebraically closed proper subfield k and a multiplicative subgroup \. This will be a proper expansion of algebraically closed field with a group satisfying the Mann property, and also pairs of algebraically closed fields. We first characterize the independence in the triple \\). This enables us to characterize the interpretable groups when \ is divisible. Every interpretable group H in \\) is, up to (...)
    No categories
    Direct download (2 more)  
     
    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.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Compact domination for groups definable in linear o-minimal structures.Pantelis E. Eleftheriou - 2009 - Archive for Mathematical Logic 48 (7):607-623.
    We prove the Compact Domination Conjecture for groups definable in linear o-minimal structures. Namely, we show that every definably compact group G definable in a saturated linear o-minimal expansion of an ordered group is compactly dominated by (G/G 00, m, π), where m is the Haar measure on G/G 00 and π : G → G/G 00 is the canonical group homomorphism.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Löwenheim–Skolem theorems for non-classical first-order algebraizable logics: Table 1.Pilar Dellunde, Àngel García-Cerdaña & Carles Noguera - 2016 - Logic Journal of the IGPL 24 (3):321-345.
  • Definability and Invariance.N. C. A. da Costa & A. A. M. Rodrigues - 2007 - Studia Logica 86 (1):1-30.
    In his thesis Para uma Teoria Geral dos Homomorfismos (1944), the Portuguese mathematician José Sebastião e Silva constructed an abstract or generalized Galois theory, that is intimately linked to F. Klein’s Erlangen Program and that foreshadows some notions and results of today’s model theory; an analogous theory was independently worked out by M. Krasner in 1938. In this paper, we present a version of the theory making use of tools which were not at Silva’s disposal. At the same time, we (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • Stable Forking and Imaginaries.Enrique Casanovas & Joris Potier - 2018 - Notre Dame Journal of Formal Logic 59 (4):497-502.
    We prove that a theory T has stable forking if and only if Teq has stable forking.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • Galois groups of first order theories.E. Casanovas, D. Lascar, A. Pillay & M. Ziegler - 2001 - Journal of Mathematical Logic 1 (02):305-319.
    We study the groups Gal L and Gal KP, and the associated equivalence relations EL and EKP, attached to a first order theory T. An example is given where EL≠ EKP. It is proved that EKP is the composition of EL and the closure of EL. Other examples are given showing this is best possible.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  • Forking in short and tame abstract elementary classes.Will Boney & Rami Grossberg - 2017 - Annals of Pure and Applied Logic 168 (8):1517-1551.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Computing the Number of Types of Infinite Length.Will Boney - 2017 - Notre Dame Journal of Formal Logic 58 (1):133-154.
    We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if κ≤λ, then sup ‖M‖=λ|Sκ|=|)κ. We show that this holds for any abstract elementary class with λ-amalgamation. No such calculation is possible for nonalgebraic types. However, we introduce a subclass of nonalgebraic types for which the same upper bound holds.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Teoría de Modelos o la venganza de Peacock.Wilfrid Hodges - 2006 - Azafea: Revista de Filosofia 8 (1).
    La teoría de modelos se basa en el concepto de interpretación de los signos matemáticos de forma que sean verdaderas ciertas fórmulas. George Peacok introdujo este concepto en 1834, como parte del debate sobre la manera de extender la matemática de los números enteros y naturales al análisis de los números reales y complejos. Él observaba la matemática «desde fuera», pero a mediados del siglo XX las ideas que él introdujo reaparecieron en una colección de teoremas matemáticos que constituyeron la (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Regular cuts in models of bounded arithmetic.Morteza Moniri & S. Hosein Sajjadi - 2013 - Bulletin of the Section of Logic 42 (1/2):11-20.
    Direct download  
     
    Export citation  
     
    Bookmark