The -consistency of elementary analysis

DOI10.21099/TKBJM/1496163087MaRDI QIDQ1375797zbMATH OpenOpenAlexFDO

Authors Kokio Shirai

Publication date 15 April 1998

Published in Tsukuba Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21099/tkbjm/1496163087

zbMATH Keywords

\(\omega\)-consistencyelementary analysistransfinite induction

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) First-order arithmetic and fragments (03F30)

Review text

Let EA be the formal system of elementary analysis. It was proved by \textit{K. Schütte} [Proof theory (1977; Zbl 0367.02012)] that we have a proof of the consistency of EA by transfinite induction up to \(\varepsilon_{\varepsilon_0}\). The purpose of this paper is to prove the following two theorems: Theorem 1. The \(\omega\)-consistency of EA can be proved by applying transfinite induction up to \(\varepsilon_{\varepsilon_1}\) for an elementary number theoretical proposition, together with exclusively elementary number theoretical techniques. Theorem 2. The \(\omega\)-consistency of EA cannot be proved by applying transfinite induction to numbers below \(\varepsilon_{\varepsilon_1}\) for the elementary number theoretical propositions, together with exclusively elementary number theoretical techniques. The proof of Theorem 1 is carried out in the same line as that of \(\omega\)-consistency of elementary number theory EN by \textit{Y. Hanatani} [Ann. Jap. Assoc. Philos. Sci. 3, 105-114 (1968; Zbl 0179.01401)], which is an application of \textit{G. Gentzen's} consistency proof of EN [Forsch. z. Logik u. z. Grundlegung d. exakt. Wiss. N.F. 4, 19-44 (1938; Zbl 0019.24103)].

Recommendations

• Consistency proof via pointwise induction
• On an extremely restricted ω-rule
• Transfinite induction within Peano arithmetic
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
• A subsystem of classical analysis proper to Takeuti's reduction method for \(\Pi ^ 1_ 1\)-analysis

Cited in

(10)

• A subsystem of classical analysis proper to Takeuti's reduction method for \(\Pi ^ 1_ 1\)-analysis
• Consistency proof via pointwise induction
• A syntactic proof of the conservativity of \(\lambda_\omega\) over \(\lambda_2\)
• A note on the \(\omega\)-incompleteness formalization
• Alpha-theory: An elementary axiomatics for nonstandard analysis
• Controversies in the foundations of analysis: comments on Schubring's \textit{Conflicts}
• On an extremely restricted ω-rule
• Number theory and elementary arithmetic†
• The relative consistency of g < cf(Sym(ω))
• scientific article; zbMATH DE number 3993538 (Why is no real title available?)

This page was built for publication: The \(\omega\)-consistency of elementary analysis

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