Class choice and the surprising weakness of Kelley-Morse set theory
Abstract
Kelley-Morse set theory KM is weaker than generally supposed and fails to prove several principles that may be desirable in a foundational second-order set theory. Even though KM includes the global choice principle, for example, (i) KM does not prove the class choice scheme, asserting that whenever every set x admits a class X with (x,X), then there is a class Z⊂eq V× V for which (x,Zx) on every section. This scheme can fail with KM even in low-complexity first-order instances and even when only a set of indices x are relevant. For closely related reasons, (ii) the theory KM does not prove the o\'s theorem scheme for internal second-order ultrapowers, even for large cardinal ultrapowers, such as the ultrapower by a normal measure on a measurable cardinal. Indeed, the theory KM itself is not generally preserved by internal ultrapowers. Finally, (iii) KM does not prove that the 1n logical complexity is invariant under first-order quantifiers, even bounded first-order quantifiers. For example, ∀ α<δ\ (α,X) is not always provably equivalent to a 11 assertion when is. Nevertheless, these various weaknesses in KM are addressed by augmenting it with the class choice scheme, thereby forming the theory KM+, which we propose as a robust KM alternative for the foundations of second-order set theory.
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.