Switch to: Citations

Add references

You must login to add references.
  1. DOP and FCP in generic structures.John Baldwin & Saharon Shelah - 1998 - Journal of Symbolic Logic 63 (2):427-438.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On generic structures with a strong amalgamation property.Koichiro Ikeda, Hirotaka Kikyo & Akito Tsuboi - 2009 - Journal of Symbolic Logic 74 (3):721-733.
    Let L be a finite relational language and α=(αR:R ∈ L) a tuple with 0 < αR ≤1 for each R ∈ L. Consider a dimension function $ \delta _\alpha (A) = \left| A \right| - \sum\limits_{R \in L} {\alpha {\mathop{\rm Re}\nolimits} R(A)} $ where each eR(A) is the number of realizations of R in A. Let $K_\alpha $ be the class of finite structures A such that $\delta _\alpha (X) \ge 0$ 0 for any substructure X of A. We (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Stable generic structures.John T. Baldwin & Niandong Shi - 1996 - Annals of Pure and Applied Logic 79 (1):1-35.
    Hrushovski originated the study of “flat” stable structures in constructing a new strongly minimal set and a stable 0-categorical pseudoplane. We exhibit a set of axioms which for collections of finite structure with dimension function δ give rise to stable generic models. In addition to the Hrushovski examples, this formalization includes Baldwin's almost strongly minimal non-Desarguesian projective plane and several others. We develop the new case where finite sets may have infinite closures with respect to the dimension function δ. In (...)
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • (1 other version)Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.
    Download  
     
    Export citation  
     
    Bookmark   69 citations