Boolean-valued second-order logic revisited
Abstract
Following the paper~[3] by V\"a\"an\"anen and the author, we continue to investigate on the difference between Boolean-valued second-order logic and full second-order logic. We show that the compactness number of Boolean-valued second-order logic is equal to ω1 if there are proper class many Woodin cardinals. This contrasts the result by Magidor~[10] that the compactness number of full second-order logic is the least extendible cardinal. We also introduce the inner model C2b constructed from Boolean-valued second-order logic using the construction of G\"odel's Constructible Universe L. We show that C2b is the least inner model of ZFC closed under Mn\# operators for all n < ω, and that C2b enjoys various nice properties as G\"odel's L does, assuming that Projective Determinacy holds in any set generic extension. This contrasts the result by Myhill and Scott~[14] that the inner model constructed from full second-order logic is equal to HOD, the class of all hereditarily ordinal definable sets.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.