Switch to: Citations

Add references

You must login to add references.
  1. Characterization of NIP theories by ordered graph-indiscernibles.Lynn Scow - 2012 - Annals of Pure and Applied Logic 163 (11):1624-1641.
    We generalize the Unstable Formula Theorem characterization of stable theories from Shelah [11], that a theory T is stable just in case any infinite indiscernible sequence in a model of T is an indiscernible set. We use a generalized form of indiscernibles from [11], in our notation, a sequence of parameters from an L-structure M, , indexed by an L′-structure I is L′-generalized indiscernible inM if qftpL′=qftpL′ implies tpL=tpL for all same-length, finite ¯,j from I. Let Tg be the theory (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Paires de structures Stables.Bruno Poizat - 1983 - Journal of Symbolic Logic 48 (2):239-249.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Stable theories with a new predicate.Enrique Casanovas & Martin Ziegler - 2001 - Journal of Symbolic Logic 66 (3):1127-1140.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Notions around tree property 1.Byunghan Kim & Hyeung-Joon Kim - 2011 - Annals of Pure and Applied Logic 162 (9):698-709.
    In this paper, we study the notions related to tree property 1 , or, equivalently, SOP2. Among others, we supply a type-counting criterion for TP1 and show the equivalence of TP1 and k- TP1. Then we introduce the notions of weak k- TP1 for k≥2, and also supply type-counting criteria for those. We do not know whether weak k- TP1 implies TP1, but at least we prove that each weak k- TP1 implies SOP1. Our generalization of the tree-indiscernibility results in (...)
    Download  
     
    Export citation  
     
    Bookmark   15 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.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Lovely pairs of models.Itay Ben-Yaacov, Anand Pillay & Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 122 (1-3):235-261.
    We introduce the notion of a lovely pair of models of a simple theory T, generalizing Poizat's “belles paires” of models of a stable theory and the third author's “generic pairs” of models of an SU-rank 1 theory. We characterize when a saturated model of the theory TP of lovely pairs is a lovely pair , finding an analog of the nonfinite cover property for simple theories. We show that, under these hypotheses, TP is also simple, and we study forking (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • (1 other version)More on SOP1 and SOP2.Saharon Shelah & Alexander Usvyatsov - 2008 - Annals of Pure and Applied Logic 155 (1):16-31.
    This paper continues the work in [S. Shelah, Towards classifying unstable theories, Annals of Pure and Applied Logic 80 229–255] and [M. Džamonja, S. Shelah, On left triangle, open*-maximality, Annals of Pure and Applied Logic 125 119–158]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the connection between maximality in the ordering left triangle, open* among complete first order theories and the SOP2 property. We (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Tree indiscernibilities, revisited.Byunghan Kim, Hyeung-Joon Kim & Lynn Scow - 2014 - Archive for Mathematical Logic 53 (1-2):211-232.
    We give definitions that distinguish between two notions of indiscernibility for a set {aη∣η∈ω>ω}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\{a_{\eta} \mid \eta \in ^{\omega>}\omega\}}$$\end{document} that saw original use in Shelah [Classification theory and the number of non-isomorphic models. North-Holland, Amsterdam, 1990], which we name s- and str−indiscernibility. Using these definitions and detailed proofs, we prove s- and str-modeling theorems and give applications of these theorems. In particular, we verify a step in the argument that TP is equivalent (...)
    Download  
     
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • (1 other version)More on SOP 1 and SOP 2.Saharon Shelah & Alexander Usvyatsov - 2008 - Annals of Pure and Applied Logic 155 (1):16-31.
    This paper continues the work in [S. Shelah, Towards classifying unstable theories, Annals of Pure and Applied Logic 80 229–255] and [M. Džamonja, S. Shelah, On left triangle, open*-maximality, Annals of Pure and Applied Logic 125 119–158]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the connection between maximality in the ordering left triangle, open* among complete first order theories and the SOP2 property. We (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • On lovely pairs of geometric structures.Alexander Berenstein & Evgueni Vassiliev - 2010 - Annals of Pure and Applied Logic 161 (7):866-878.
    We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We use the pairs to isolate a class of geometric structures called weakly locally modular which generalizes the class of linear structures in the settings of SU-rank one theories and o-minimal theories. For o-minimal theories, we use the Peterzil–Starchenko trichotomy theorem to characterize for a sufficiently general point, the local geometry around it in terms of the thorn U-rank of its type inside a lovely pair.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • On the existence of indiscernible trees.Kota Takeuchi & Akito Tsuboi - 2012 - Annals of Pure and Applied Logic 163 (12):1891-1902.
    We introduce several concepts concerning the indiscernibility of trees. A tree is by definition an ordered set such that, for any a∈O, the initial segment {b∈O:b (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • An independence theorem for ntp2 theories.Itaï Ben Yaacov & Artem Chernikov - 2014 - Journal of Symbolic Logic 79 (1):135-153.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Generic pairs of SU-rank 1 structures.Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 120 (1-3):103-149.
    For a supersimple SU-rank 1 theory T we introduce the notion of a generic elementary pair of models of T . We show that the theory T* of all generic T-pairs is complete and supersimple. In the strongly minimal case, T* coincides with the theory of infinite dimensional pairs, which was used in 1184–1194) to study the geometric properties of T. In our SU-rank 1 setting, we use T* for the same purpose. In particular, we obtain a characterization of linearity (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations