Epsilon substitution for $$\textit{ID}_1$$ ID 1 via cut-elimination

Archive for Mathematical Logic 57 (5-6):497-531 (2018)
  Copy   BIBTEX

Abstract

The \-substitution method is a technique for giving consistency proofs for theories of arithmetic. We use this technique to give a proof of the consistency of the impredicative theory \ using a variant of the cut-elimination formalism introduced by Mints.

Categories

Keywords

Reprint years

DOI

10.1007/s00153-017-0590-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

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

Through your library

My notes

Similar books and articles

Epsilon substitution for transfinite induction.Henry Towsner - 2005 - Archive for Mathematical Logic 44 (4):397-412.
Epsilon substitution method for theories of jump hierarchies.Toshiyasu Arai - 2002 - Archive for Mathematical Logic 41 (2):123-153.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
Cut elimination for a simple formulation of epsilon calculus.Grigori Mints - 2008 - Annals of Pure and Applied Logic 152 (1):148-160.
Quick cut-elimination for strictly positive cuts.Toshiyasu Arai - 2011 - Annals of Pure and Applied Logic 162 (10):807-815.
Gentzen’s consistency proof without heightlines.Annika Siders - 2013 - Archive for Mathematical Logic 52 (3-4):449-468.
Cut-Elimination for Impredicative Infinitary Systems. Part I. Ordinal- Analysis for ID 1.W. Pohlers - 1983 - Journal of Symbolic Logic 48 (3):879-880.
Epsilon substitution method for [Π0 1, Π0 1]-FIX.T. Arai - 2005 - Archive for Mathematical Logic 44 (8):1009-1043.
Epsilon substitution method for ID1.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 121 (2-3):163-208.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.

Analytics

Added to PP
2017-09-20

Downloads
16 (#227,957)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Die Widerspruchsfreiheit der reinen Zahlentheorie.Gerhard Gentzen - 1936 - Journal of Symbolic Logic 1 (2):75-75.
Grundlagen der Mathematik.S. C. Kleene - 1940 - Journal of Symbolic Logic 5 (1):16-20.
Proof-theoretic analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.

View all 18 references / Add more references