The Hanf numbers of stationary logic. II. Comparison with other logics
Saharon Shelah
Abstract
We show that the ordering of the Hanf number of Lomega, omega(wo) (well ordering), Lcomega, omega (quantification on countable sets), Lomega, 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 Llambda, mu .
Create a lesson
Related papers
On the foundations of logic and probability, I. Modal sentential calculi
Loic Cosyns
Compactness via Consistency Properties
Edgar Valenzuela
Fine Selection for Intuitionistic Modal Logic
David Fernández-Duque
Asymptotic dimension of commutative monoid actions
Jinmin Wang, Jing Yu, Jingming Zhu
Pointwise provable equality and the failure of composition
Florian Lengyel
Compactness beyond choice and HOD
Jonathan Osinski