Characterizations of ordinal analysis
James Walsh

TL;DR
This paper provides an abstract characterization of ordinal analysis, linking it to equivalence relations and orderings on theories based on proof-theoretic ordinals, and explores its relation to notions of theory strength.
Contribution
It offers novel abstract characterizations of ordinal analysis as a partition and an ordering of theories, connecting it to proof-theoretic ordinals and strength measures.
Findings
Ordinal analysis characterized as a partition of theories with same proof-theoretic ordinal.
No finer equivalence relation than the ordinal analysis partition under certain conditions.
Ordinal analysis corresponds to an ordering based on proof-theoretic ordinals, aligning with strength measures.
Abstract
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories. According to conventional wisdom, ordinal analysis measures the strength of theories. Yet what is the attendant notion of strength? In this paper we present abstract characterizations of ordinal analysis that address this question. First, we characterize ordinal analysis as a partition of -definable and -sound theories, namely, the partition whereby two theories are equivalent if they have the same proof-theoretic ordinal. We show that no equivalence relation is finer than the ordinal analysis partition if both: (1) whenever and prove the same sentences; (2) for every set of true sentences. In fact, no such equivalence relation makes a single distinction that the ordinal analysis partition does…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge
