Switch to: References

Add citations

You must login to add citations.
  1. Complexity Ranks of Countable Models.Su Gao - 2007 - Notre Dame Journal of Formal Logic 48 (1):33-48.
    We define some variations of the Scott rank for countable models and obtain some inequalities involving the ranks. For mono-unary algebras we prove that the game rank of any subtree does not exceed the game rank of the whole model. However, similar questions about linear orders remain unresolved.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hanf numbers for extendibility and related phenomena.John T. Baldwin & Saharon Shelah - 2022 - Archive for Mathematical Logic 61 (3):437-464.
    This paper contains portions of Baldwin’s talk at the Set Theory and Model Theory Conference and a detailed proof that in a suitable extension of ZFC, there is a complete sentence of \ that has maximal models in cardinals cofinal in the first measurable cardinal and, of course, never again.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Linear orderings and powers of characterizable cardinals.Ioannis Souldatos - 2012 - Annals of Pure and Applied Logic 163 (3):225-237.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Knight's model, its automorphism group, and characterizing the uncountable cardinals.Greg Hjorth - 2002 - Journal of Mathematical Logic 2 (01):113-144.
    We show that every ℵα can be characterized by the Scott sentence of some countable model; moreover there is a countable structure whose Scott sentence characterizes ℵ1 but whose automorphism group fails the topological Vaught conjecture on analytic sets. We obtain some partial information on Ulm type dichotomy theorems for the automorphism group of Knight's model.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Complete Lω1,ω‐sentences with maximal models in multiple cardinalities.John Baldwin & Ioannis Souldatos - 2019 - Mathematical Logic Quarterly 65 (4):444-452.
    In [5], examples of incomplete sentences are given with maximal models in more than one cardinality. The question was raised whether one can find similar examples of complete sentences. In this paper, we give examples of complete ‐sentences with maximal models in more than one cardinality. From (homogeneous) characterizability of κ we construct sentences with maximal models in κ and in one of and more. Indeed, consistently we find sentences with maximal models in uncountably many distinct cardinalities.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Notes on Cardinals That Are Characterizable by a Complete (Scott) Sentence.Ioannis Souldatos - 2014 - Notre Dame Journal of Formal Logic 55 (4):533-551.
    This is the first part of a study on cardinals that are characterizable by Scott sentences. Building on previous work of Hjorth, Malitz, and Baumgartner, we study which cardinals are characterizable by a Scott sentence $\phi$, in the sense that $\phi$ characterizes $\kappa$, if $\phi$ has a model of size $\kappa$ but no models of size $\kappa^{+}$. We show that the set of cardinals that are characterized by a Scott sentence is closed under successors, countable unions, and countable products. We (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations