Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Non-forking and preservation of NIP and dp-rank.Pedro Andrés Estevan & Itay Kaplan - 2021 - Annals of Pure and Applied Logic 172 (6):102946.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Stationarily ordered types and the number of countable models.Slavko Moconja & Predrag Tanović - 2020 - Annals of Pure and Applied Logic 171 (3):102765.
    We introduce the notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the former is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary relation on elements realizing stationarily ordered types, is an equivalence relation and that each stationarily ordered type in a model determines some order-type as an invariant of the model. We study weak and forking non-orthogonality of stationarily ordered types, show that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Exact saturation in simple and NIP theories.Itay Kaplan, Saharon Shelah & Pierre Simon - 2017 - Journal of Mathematical Logic 17 (1):1750001.
    A theory [Formula: see text] is said to have exact saturation at a singular cardinal [Formula: see text] if it has a [Formula: see text]-saturated model which is not [Formula: see text]-saturated. We show, under some set-theoretic assumptions, that any simple theory has exact saturation. Also, an NIP theory has exact saturation if and only if it is not distal. This gives a new characterization of distality.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Theories without the tree property of the second kind.Artem Chernikov - 2014 - Annals of Pure and Applied Logic 165 (2):695-723.
    We initiate a systematic study of the class of theories without the tree property of the second kind — NTP2. Most importantly, we show: the burden is “sub-multiplicative” in arbitrary theories ; NTP2 is equivalent to the generalized Kimʼs lemma and to the boundedness of ist-weight; the dp-rank of a type in an arbitrary theory is witnessed by mutually indiscernible sequences of realizations of the type, after adding some parameters — so the dp-rank of a 1-type in any theory is (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations