Switch to: References

Add citations

You must login to add citations.
  1. Around definable types in p-adically closed fields.Pablo Andújar Guerrero & Will Johnson - 2024 - Annals of Pure and Applied Logic 175 (10):103484.
    Download  
     
    Export citation  
     
    Bookmark  
  • Dp-minimality: Invariant types and dp-rank.Pierre Simon - 2014 - Journal of Symbolic Logic 79 (4):1025-1045.
    This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the -theorem holds in dp-minimal theories of small or medium directionality.In the second part, we study dp-rank in dp-minimal theories and show that it enjoys many nice properties. It is continuous, definable in families and it can be characterised geometrically with no mention of indiscernible sequences. In particular, if the structure (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Invariant types in NIP theories.Pierre Simon - 2015 - Journal of Mathematical Logic 15 (2):1550006.
    We study invariant types in NIP theories. Amongst other things: we prove a definable version of the [Formula: see text]-theorem in theories of small or medium directionality; we construct a canonical retraction from the space of [Formula: see text]-invariant types to that of [Formula: see text]-finitely satisfiable types; we show some amalgamation results for invariant types and list a number of open questions.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Definable groups in models of Presburger Arithmetic.Alf Onshuus & Mariana Vicaría - 2020 - Annals of Pure and Applied Logic 171 (6):102795.
    This paper is devoted to understand groups definable in Presburger Arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded abelian group definable in a model of (Z, +, <) Presburger Arithmetic is definably isomorphic to (Z, +)^n mod out by a lattice.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Definable -Theorem for Families with Vc-Codensity Less Than.Pablo Andújar Guerrero - forthcoming - Journal of Symbolic Logic:1-10.
    Download  
     
    Export citation  
     
    Bookmark