An ordinal (often presented via a notation system) that measures the proof-theoretic strength of a formal theory, typically defined as the supremum of ordinals for which the theory can prove transfinite induction or well-foundedness of corresponding notation systems.

Principle

A proof-theoretic ordinal calibrates how far a theory can carry out certain kinds of transfinite reasoning: larger ordinals correspond to greater ability to justify forms of induction or to prove well-foundedness of more complex recursive orderings.

Demonstration

Peano Arithmetic (PA) has proof-theoretic ordinal ε0: PA proves transfinite induction for all ordinals below ε0 (represented in a suitable notation), but cannot prove well-foundedness or full induction up to ε0 itself; stronger theories have larger ordinals.

Misapplication

Reading the proof-theoretic ordinal as an absolute set-theoretic ordinal independent of notation choices or as the same measure of strength used in model-theoretic comparisons; ordinal notations and formalization choices influence the assigned ordinal.

Consequence

Proof-theoretic ordinals enable precise comparison of theories' deductive strength, guide the design of ordinal analyses and consistency proofs, and show which transfinite principles a theory can justify.

Reversal

Failing to assign a meaningful proof-theoretic ordinal to a theory occurs when the theory is not recursively axiomatizable or when no acceptable ordinal notation system is fixed; model-theoretic consistency strength is a different, often incomparable, notion.

Boundary

Defined primarily for recursively presentable theories and relative to chosen ordinal notation systems and formal encodings; it excludes purely semantic or non-constructive measures of strength and depends on technical choices.

Semantic Tension

There is tension between viewing the ordinal as an intrinsic measure of a theory's capability and recognizing its dependence on the chosen constructive ordinal notations and proof framework; proof-theoretic and model-theoretic strengths may diverge.

Synthesis

A proof-theoretic ordinal is a constructive ordinal-bound that encapsulates the transfinite induction and well-foundedness a theory can certify; it provides a fine-grained, technical yardstick for comparing the deductive reach of formal systems while depending on notation and formalization choices.