Induction and transfinite induction in intuitionistic systems

Annals of Mathematical Logic 4 (2):173 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(72)90014-9

Links

PhilArchive



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

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

Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis.W. A. Howard & G. Kreisel - 1966 - Journal of Symbolic Logic 31 (3):325-358.
Intuitionistically provable recursive well-orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.
La descente infinie, l’induction transfinie et le tiers exclu.Yvon Gauthier - 2009 - Dialogue 48 (1):1.
Troubles with (the concept of) truth in mathematics.Roman Murawski - 2006 - Logic and Logical Philosophy 15 (4):285-303.
Epsilon substitution for transfinite induction.Henry Towsner - 2005 - Archive for Mathematical Logic 44 (4):397-412.
Some new double induction and superinduction principles.Raymond M. Smullyan - 1990 - Studia Logica 49 (1):23 - 30.
Variation on a theme of Schutte.D. Probst & G. Jager - 2004 - Mathematical Logic Quarterly 50 (3):258.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Fast-Collapsing Theories.Samuel A. Alexander - 2013 - Studia Logica (1):1-21.
Induction and foundation in the theory of hereditarily finite sets.Flavio Previale - 1994 - Archive for Mathematical Logic 33 (3):213-241.
Ordinal inequalities, transfinite induction, and reverse mathematics.Jeffry L. Hirst - 1999 - Journal of Symbolic Logic 64 (2):769-774.
Ordinal Inequalities, Transfinite Induction, and Reverse Mathematics.Jeffry Hirst - 1999 - Journal of Symbolic Logic 64 (2):769-774.
A material dissolution of the problem of induction.John D. Norton - 2014 - Synthese 191 (4):1-20.
An Upper Bound for the Provability of Transfinite Induction in Systems with N-Times Iterated Inductive Definitions.Kurt Schutte, W. Pohlers, J. Diller & G. H. Muller - 1983 - Journal of Symbolic Logic 48 (3):878.
Intuitionistic Open Induction and Least Number Principle and the Buss Operator.Mohammad Ardeshir & Mojtaba Moniri - 1998 - Notre Dame Journal of Formal Logic 39 (2):212-220.

Analytics

Added to PP
2014-01-17

Downloads
30 (#525,754)

6 months
5 (#630,279)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The correspondence between cut-elimination and normalization.J. Zucker - 1974 - Annals of Mathematical Logic 7 (1):1-112.
The correspondence between cut-elimination and normalization II.J. Zucker - 1974 - Annals of Mathematical Logic 7 (2):113.

Add more citations

References found in this work

Concerning formulas of the types a →b ∨c, a →(ex)b(X).Ronald Harrop - 1960 - Journal of Symbolic Logic 25 (1):27-32.

Add more references