A simplified ordinal analysis of first-order reflection
Abstract
In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system OT is introduced based on -functions. Provable 1-sentences on Lω1CK are bounded through cut-elimination on operator controlled derivations.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.