arXiv:math/9201243 [math.LO]AbstractReferencesReviewsResources
The Hanf numbers of stationary logic. II. Comparison with other logics
Published 1991-01-15Version 1
We show that the ordering of the Hanf number of L_{omega, omega}(wo) (well ordering), L^c_{omega, omega} (quantification on countable sets), L_{omega, omega}(aa) (stationary logic) and second order logic, have no more restraints provable in ZFC than previously known (those independence proofs assume CON(ZFC) only). We also get results on corresponding logics for L_{lambda, mu} .
Related articles: Most relevant | Search more
arXiv:1602.01156 [math.LO] (Published 2016-02-02)
Hanf Number for Scott Sentences of Computable Structures
arXiv:2009.03348 [math.LO] (Published 2020-09-07)
Strong downward Löwenheim-Skolem theorems for stationary logics, II -- reflection down to the continuum
arXiv:2003.12692 [math.LO] (Published 2020-03-28)
The $Π^1_1 \! \! \downarrow$ Löwenheim-Skolem-Tarski property of Stationary Logic