On a Hierarchy of Reflection Principles in Peano Arithmetic
Elena Nogina

TL;DR
This paper explores the hierarchy of reflection principles in Peano Arithmetic, showing their equivalence to specific provability conditions and establishing a non-collapsing order of their deductive strength.
Contribution
It characterizes all reflection principles in PA as equivalent to either basic provability or iterated provability, forming a strict hierarchy.
Findings
Reflection principles are equivalent to specific provability conditions.
The hierarchy of reflection principles is non-collapsing.
A strict order of deductive strength is established among these principles.
Abstract
We study reflection principles of Peano Arithmetic PA which are based on both proof and provability. Any such reflection principle in PA is equivalent to either ( stands for ` is provable') or for some ( states ` is a proof of '). Reflection principles constitute a non-collapsing hierarchy with respect to their deductive strength
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
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · Logic, programming, and type systems
