Switch to: References

Add citations

You must login to add citations.
  1. A Supersimple Nonlow Theory.Enrique Casanovas & Byunghan Kim - 1998 - Notre Dame Journal of Formal Logic 39 (4):507-518.
    This paper presents an example of a supersimple nonlow theory and characterizes its independence relation.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The number of types in simple theories.Enrique Casanovas - 1999 - Annals of Pure and Applied Logic 98 (1-3):69-86.
    We continue work of Shelah on the cardinality of families of pairwise incompatible types in simple theories obtaining characterizations of simple and supersimple theories. We develop a local analysis of the number of types in simple theories and we find a new example of a simple unstable theory.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Galois groups of first order theories.E. Casanovas, D. Lascar, A. Pillay & M. Ziegler - 2001 - Journal of Mathematical Logic 1 (02):305-319.
    We study the groups Gal L and Gal KP, and the associated equivalence relations EL and EKP, attached to a first order theory T. An example is given where EL≠ EKP. It is proved that EKP is the composition of EL and the closure of EL. Other examples are given showing this is best possible.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • The Lascar Group and the Strong Types of Hyperimaginaries.Byunghan Kim - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):497-507.
    This is an expository note on the Lascar group. We also study the Lascar group over hyperimaginaries and make some new observations on the strong types over those. In particular, we show that in a simple theory $\operatorname{Ltp}\equiv\operatorname{stp}$ in real context implies that for hyperimaginary context.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Simplicity, and stability in there.Byunghan Kim - 2001 - Journal of Symbolic Logic 66 (2):822-836.
    Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover definability part of stability theory to simplicity theory. In particular, using elimination of hyperimaginaries we prove that for any supersimple T, canonical base of an amalgamation class P is the union of names of ψ-definitions of P, ψ ranging over stationary L-formulas in P. Also, we prove that the same is true with stable formulas for an 1-based theory having (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Elimination of Hyperimaginaries and Stable Independence in Simple CM-Trivial Theories.D. Palacín & F. O. Wagner - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):541-551.
    In a simple CM-trivial theory every hyperimaginary is interbounded with a sequence of finitary hyperimaginaries. Moreover, such a theory eliminates hyperimaginaries whenever it eliminates finitary hyperimaginaries. In a supersimple CM-trivial theory, the independence relation is stable.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On omega-categorical simple theories.Daniel Palacín - 2012 - Archive for Mathematical Logic 51 (7-8):709-717.
    In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable ω-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded finite weight are low.
    Download  
     
    Export citation  
     
    Bookmark  
  • From stability to simplicity.Byunghan Kim & Anand Pillay - 1998 - Bulletin of Symbolic Logic 4 (1):17-36.
    §1. Introduction. In this report we wish to describe recent work on a class of first order theories first introduced by Shelah in [32], the simple theories. Major progress was made in the first author's doctoral thesis [17]. We will give a survey of this, as well as further works by the authors and others.The class of simple theories includes stable theories, but also many more, such as the theory of the random graph. Moreover, many of the theories of particular (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Supersimple ω-categorical theories and pregeometries.Vera Koponen - 2019 - Annals of Pure and Applied Logic 170 (12):102718.
    Download  
     
    Export citation  
     
    Bookmark  
  • Generalizations of small profinite structures.Krzysztof Krupiński - 2010 - Journal of Symbolic Logic 75 (4):1147-1175.
    We generalize the model theory of small profinite structures developed by Newelski to the case of compact metric spaces considered together with compact groups of homeomorphisms and satisfying the existence of m-independent extensions (we call them compact e-structures). We analyze the relationships between smallness and different versions of the assumption of the existence of m-independent extensions and we obtain some topological consequences of these assumptions. Using them, we adopt Newelski's proofs of various results about small profinite structures to compact e-structures. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
    We investigate some topological properties of the spaces of classes of bounded type-definable equivalence relations.
    Download  
     
    Export citation  
     
    Bookmark   8 citations