Wellfoundedness proof with the maximal distinguished set
Abstract
In arXiv:2208.12944 it is shown that an ordinal N<ω_1(_S+N+1) is an upper bound for the proof-theoretic ordinal of a set theory KPr+(M_1V). In this paper we show that a second order arithmetic 1-2-CA+11-CA0 proves the wellfoundedness up to _1(_S+N+1) for each N. It is easy to interpret 1-2-CA+11-CA0 in KPr+(M_1V).
0
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.