Switch to: References

Add citations

You must login to add citations.
  1. The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
    We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Motto Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
    We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Craig Interpolation Theorem in abstract model theory.Jouko Väänänen - 2008 - Synthese 164 (3):401-420.
    The Craig Interpolation Theorem is intimately connected with the emergence of abstract logic and continues to be the driving force of the field. I will argue in this paper that the interpolation property is an important litmus test in abstract model theory for identifying “natural,” robust extensions of first order logic. My argument is supported by the observation that logics which satisfy the interpolation property usually also satisfy a Lindström type maximality theorem. Admittedly, the range of such logics is small.
    Download  
     
    Export citation  
     
    Bookmark   2 citations