Reflection Principle

A reflection principle in proof theory and set theory is an axiom schema asserting that certain properties of the universe of mathematical objects are 'reflected' into smaller subcollections — or, equivalently, that what is true can be recognized as true within some extended formal system. In the context of formal provability, a reflection principle for a system S states: 'If S proves statement P, then P is true.' Adding reflection principles to a system yields a strictly stronger system: accepting that S's proofs are reliable allows reasoning that S itself cannot perform.

Reflection principles are the formal mechanism behind the informal practice of 'recognizing' a Gödel sentence as true after showing it is unprovable. Each such recognition corresponds to ascending to a system with a higher proof-theoretic ordinal. The ascent through reflection principles is not arbitrary: it follows the precise hierarchy charted by ordinal analysis, where each step corresponds to accepting the well-foundedness of a larger ordinal.

In ZFC, reflection principles appear as the assertion that any first-order property of the cumulative hierarchy V is reflected into some level V_α of the von Neumann universe — a result that is actually provable within ZFC and forms the basis for the large cardinal hierarchy. The connection to automated theorem provers that implement reflection is direct: each extension of a prover's reasoning capacity by adding a new reflection axiom is a measured ascent in foundational strength. See also Predicativity.