Reflection Principles in Fragments of Peano Arithmetic

From MaRDI portal
Publication:3745836





We develop a proof-theoretic study of reflection principles of fragments of Peano arithmetic, comparing them with restricted forms of various principles, such as transfinite inductions, large set principles and well-ordering principles. Let \(I\Sigma _ k\) be the fragment of arithmetic whose induction is restricted to \(\Sigma _ k\)-formulas. \(RFN_{\Sigma _ m}(I\Sigma _ k)\) and \(TI_{\Pi _ m}[\omega _ n]\) denote the uniform \(\Sigma _ m\)-reflection principle of \(I\Sigma _ k\) and the transfinite induction up to \(\omega _ n\) for \(\Pi _ m\)-formulas, respectively. Then, our results say that in \(I\Sigma _ 1\), \(RFN_{\Sigma _{m+1}}(I\Sigma _{m+n-1})\) implies \(TI_{\Pi _ m}[\omega _{n+1}]\), which implies \(RFN_{\Sigma _ m}(I\Sigma _{m+n-1})\). Thus, these reflection principles and transfinite inductions form a simple hierarchy. The reduction method, introduced in our paper, which comes from Skolemization technique, will be found to be useful.











This page was built for publication: Reflection Principles in Fragments of Peano Arithmetic

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