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
Stalnaker's logical problem of conditionals is unsolvable
Alexander W. Kocurek, James Walsh, Yale Weiss
Strong completeness of the logic J
Juan P. Aguilera, Grigorii Stepanov
Lévy-Montague reflection is Π11-conservative over WKL0
Fedor Pakhomov
Contact relations on bounded distributive lattices and related structures
Ivo Düntsch, Rafał Gruszczyński
Embeddings of Propositional Logics into the Provability Logics S and D
Mashu Noguchi
Some results on NIP groups and their Ellis groups
Atticus Stonestrom