Iterated trees and fragments of arithmetic
The paper is devoted to some problems connected with the so-called Recursion Theory in Fragments of Arithmetic. It is an analogue of reverse mathematics. The main result of the paper states that the general \(O^{(n)}\)-priority method succeeds iff the induction scheme for \(\Sigma_n\) formulas \((I \Sigma_n)\) holds. As a consequence one gets that if we have an iterated trees style \(O^{(n)}\)-priority proof of a theorem, then we know that the theorem can be proved in the fragment \(\text{PA}^- + I \Sigma_n\). It is also shown that the iterated trees framework is in fact applicable to the finite injury level.
- Countable algebra and set existence axioms
- Finite injury and Σ1-induction
- scientific article; zbMATH DE number 4150132 (Why is no real title available?)
- scientific article; zbMATH DE number 3689386 (Why is no real title available?)
- On some games which are relevant to the theory of recursively enumerable sets
- Topological Framework for Non‐Priority
This page was built for publication: Iterated trees and fragments of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892096)