scientific article; zbMATH DE number 4061229
We say that an extension T of Peano arithmetic PA is correct iff all theorems of T are true in the standard model of arithmetic. Let \(Con^ o\) be \((0=0)\), \(Con^{n+1}=Consis(\ulcorner Con^ n\urcorner)\) where Consis(\(\ulcorner \psi \urcorner)\) is standard Gödel consistency formula for \(PA+\psi\). Let d(X) denote the Turing degree of X. The main result: For all \(\beta\) \(\subseteq \omega\) \(d(PA+\{Con^ n\to Con^{n+1}| \quad n\in \beta \})=0'\cup d(\beta).\)Corollary: Turing degrees of all correct extensions of PA form the ideal \(\{\) \(a| 0'\leq a\}.\) An algorithmic analogue of the main result has been proved by \textit{J. P. Jones} [J. Symb. Logic 34, 597-604 (1969; Zbl 0191.305)].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795673)