Some Results on Cut-Elimination, Provable Well-Orderings, Induction and Reflection

Bulletin of Symbolic Logic 7 (1):77-78 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2687831

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Review: Toshiyasu Arai, Some Results on Cut-Elimination, Provable Well-Orderings, Induction and Reflection. [REVIEW]Jeremy Avigad - 2001 - Bulletin of Symbolic Logic 7 (1):77-78.
Some results on cut-elimination, provable well-orderings, induction and reflection.Toshiyasu Arai - 1998 - Annals of Pure and Applied Logic 95 (1-3):93-184.
Intuitionistically provable recursive well-orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.
Algebraic proofs of cut elimination.Jeremy Avigad - manuscript
Epsilon substitution for transfinite induction.Henry Towsner - 2005 - Archive for Mathematical Logic 44 (4):397-412.
Borel quasi-orderings in subsystems of second-order arithmetic.Alberto Marcone - 1991 - Annals of Pure and Applied Logic 54 (3):265-291.
Bar induction and ω model reflection.Gerhard Jäger & Thomas Strahm - 1999 - Annals of Pure and Applied Logic 97 (1-3):221-230.
Contraction-elimination for implicational logics.Ryo Kashima - 1997 - Annals of Pure and Applied Logic 84 (1):17-39.
Diophantine Induction.Richard Kaye - 1990 - Annals of Pure and Applied Logic 46 (1):1-40.
The role of parameters in bar rule and bar induction.Michael Rathjen - 1991 - Journal of Symbolic Logic 56 (2):715-730.
Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
Proof-theoretic analysis by iterated reflection.Lev D. Beklemishev - 2003 - Archive for Mathematical Logic 42 (6):515-552.
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
Proof theory of reflection.Michael Rathjen - 1994 - Annals of Pure and Applied Logic 68 (2):181-224.

Analytics

Added to PP
2017-02-22

Downloads
1 (#1,886,728)

6 months
1 (#1,510,037)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Proof-theoretic strengths of the well-ordering principles.Toshiyasu Arai - 2020 - Archive for Mathematical Logic 59 (3-4):257-275.

Add more citations

References found in this work

No references found.

Add more references