Switch to: References

Add citations

You must login to add citations.
  1. Constructing the hyperdefinable group from the group configuration.Tristram de Piro, Byunghan Kim & Jessica Millar - 2006 - Journal of Mathematical Logic 6 (2):121-139.
    Under [Formula: see text]-amalgamation, we obtain the canonical hyperdefinable group from the group configuration.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • 10th Asian Logic Conference: Sponsored by the Association for Symbolic Logic.Toshiyasu Arai - 2009 - Bulletin of Symbolic Logic 15 (2):246-265.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Disjoint $n$ -Amalgamation and Pseudofinite Countably Categorical Theories.Alex Kruckman - 2019 - Notre Dame Journal of Formal Logic 60 (1):139-160.
    Disjoint n-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this article, we show that if a countably categorical theory T admits an expansion with disjoint n-amalgamation for all n, then T is pseudofinite. All theories which admit an expansion with disjoint n-amalgamation for all n are simple, but the method can be extended, using filtrations of Fraïssé classes, to show that certain nonsimple theories are pseudofinite. As (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Supersimple ω-categorical theories and pregeometries.Vera Koponen - 2019 - Annals of Pure and Applied Logic 170 (12):102718.
  • Type-amalgamation properties and polygroupoids in stable theories.John Goodrick, Byunghan Kim & Alexei Kolesnikov - 2015 - Journal of Mathematical Logic 15 (1):1550004.
    We show that in a stable first-order theory, the failure of higher dimensional type amalgamation can always be witnessed by algebraic structures that we call n-ary polygroupoids. This generalizes a result of Hrushovski in [16] that failures of 4-amalgamation are witnessed by definable groupoids. The n-ary polygroupoids are definable in a mild expansion of the language.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Homology Groups of Types in Model Theory and the Computation of H 2.John Goodrick, Byunghan Kim & Alexei Kolesnikov - 2013 - Journal of Symbolic Logic 78 (4):1086-1114.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations