On a Hierarchy of Reflection Principles in Peano Arithmetic

arXiv1405.2558MaRDI QIDQ6251439FDOQ6251439

Authors: Elena Nogina 

Publication date: 11 May 2014

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 $BoxP!ightarrow!P$ ($BoxP$ stands for `$P$ is provable') or $Bo{x}^{k}u!!:!!P!ightarrow!P$ for some $kgeq0$ ($t:P$ states `$t$ is a proof of $P$'). Reflection principles constitute a non-collapsing hierarchy with respect to their deductive strength ${\displaystyle }$u!!:!!P! ightarrow! P prec Box u!!:!!P! ightarrow! P prec Box^2 u!!:!!P! ightarrow! P prec ldots prec Box P! ightarrow! P.${\displaystyle }$

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) First-order arithmetic and fragments (03F30) Relative consistency and interpretations (03F25) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

This page was built for publication: On a Hierarchy of Reflection Principles in Peano Arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6251439)