Switch to: Citations

Add references

You must login to add references.
  1. On generically stable types in dependent theories.Alexander Usvyatsov - 2009 - Journal of Symbolic Logic 74 (1):216-250.
    We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent theories.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • 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.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   27 citations  
  • On dp-minimality, strong dependence and weight.Alf Onshuus & Alexander Usvyatsov - 2011 - Journal of Symbolic Logic 76 (3):737 - 758.
    We study dp-minimal and strongly dependent theories and investigate connections between these notions and weight.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   15 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 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   36 citations  
  • Forking and dividing in NTP₂ theories.Artem Chernikov & Itay Kaplan - 2012 - Journal of Symbolic Logic 77 (1):1-20.
    We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that dependence is equivalent to bounded non-forking assuming NTP 2.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   26 citations