Consistency proof via pointwise induction

Archive for Mathematical Logic 37 (3):149-165 (1998)
  Copy   BIBTEX

Abstract

We show that the consistency of the first order arithmetic $PA$ follows from the pointwise induction up to the Howard ordinal. Our proof differs from U. Schmerl [Sc]: We do not need Girard's Hierarchy Comparison Theorem. A modification on the ordinal assignment to proofs by Gentzen and Takeuti [T] is made so that one step reduction on proofs exactly corresponds to the stepping down $\alpha\mapsto\alpha [1]$ in ordinals. Also a generalization to theories $ID_q$ of finitely iterated inductive definitions is proved

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Pointwise hereditary majorization and some applications.Ulrich Kohlenbach - 1992 - Archive for Mathematical Logic 31 (4):227-241.
Gentzen’s consistency proof without heightlines.Annika Siders - 2013 - Archive for Mathematical Logic 52 (3-4):449-468.
Ordinal diagrams for recursively Mahlo universes.Toshiyasu Arai - 2000 - Archive for Mathematical Logic 39 (5):353-391.
Consistency, Models, and Soundness.Matthias Schirn - 2010 - Global Philosophy 20 (2-3):153-207.
Propositional Proof Systems and Fast Consistency Provers.Joost J. Joosten - 2007 - Notre Dame Journal of Formal Logic 48 (3):381-398.
On the philosophical significance of consistency proofs.Michael D. Resnik - 1974 - Journal of Philosophical Logic 3 (1/2):133 - 147.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.

Analytics

Added to PP
2013-11-23

Downloads
22 (#606,933)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Intuitionistic fixed point theories over set theories.Toshiyasu Arai - 2015 - Archive for Mathematical Logic 54 (5-6):531-553.
Slow versus fast growing.Andreas Weiermann - 2002 - Synthese 133 (1-2):13 - 29.
Inductive definitions over a predicative arithmetic.Stanley S. Wainer & Richard S. Williams - 2005 - Annals of Pure and Applied Logic 136 (1-2):175-188.

View all 6 citations / Add more citations

References found in this work

A new system of proof-theoretic ordinal functions.W. Buchholz - 1986 - Annals of Pure and Applied Logic 32:195-207.

Add more references