Switch to: Citations

Add references

You must login to add references.
  1. On $n$ -Dependence.Artem Chernikov, Daniel Palacin & Kota Takeuchi - 2019 - Notre Dame Journal of Formal Logic 60 (2):195-214.
    In this article, we develop and clarify some of the basic combinatorial properties of the new notion of n-dependence recently introduced by Shelah. In the same way as dependence of a theory means its inability to encode a bipartite random graph with a definable edge relation, n-dependence corresponds to the inability to encode a random -partite -hypergraph with a definable edge relation. We characterize n-dependence by counting φ-types over finite sets, and in terms of the collapse of random ordered -hypergraph (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   6 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   69 citations  
  • Dp-Minimality: Basic Facts and Examples.Alfred Dolich, John Goodrick & David Lippel - 2011 - Notre Dame Journal of Formal Logic 52 (3):267-288.
    We study the notion of dp-minimality, beginning by providing several essential facts about dp-minimality, establishing several equivalent definitions for dp-minimality, and comparing dp-minimality to other minimality notions. The majority of the rest of the paper is dedicated to examples. We establish via a simple proof that any weakly o-minimal theory is dp-minimal and then give an example of a weakly o-minimal group not obtained by adding traces of externally definable sets. Next we give an example of a divisible ordered Abelian (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Decidability and undecidability of theories with a predicate for the primes.P. T. Bateman, C. G. Jockusch & A. R. Woods - 1993 - Journal of Symbolic Logic 58 (2):672-687.
    It is shown, assuming the linear case of Schinzel's Hypothesis, that the first-order theory of the structure $\langle \omega; +, P\rangle$ , where P is the set of primes, is undecidable and, in fact, that multiplication of natural numbers is first-order definable in this structure. In the other direction, it is shown, from the same hypothesis, that the monadic second-order theory of $\langle\omega; S, P\rangle$ is decidable, where S is the successor function. The latter result is proved using a general (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On dp-minimal ordered structures.Pierre Simon - 2011 - Journal of Symbolic Logic 76 (2):448 - 460.
    We show basic facts about dp-minimal ordered structures. The main results are: dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has non-empty interior, and any theory of pure tree is dp-minimal.
    Download  
     
    Export citation  
     
    Bookmark   27 citations