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: 93,031

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: Bruno Scarpellini, Proof Theory and Intuitionistic Systems. [REVIEW]A. S. Troelstra - 1974 - Journal of Symbolic Logic 39 (3):607-609.
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.
Transfinite Induction on Ordinal Configurations.Luiz Paulo de Alcantara & Walter Alexandre Carnielli - 1981 - Mathematical Logic Quarterly 27 (31-35):531-538.
Transfinite Induction on Ordinal Configurations.Luiz Paulo de Alcantara & Walter Alexandre Carnielli - 1981 - Mathematical Logic Quarterly 27 (31‐35):531-538.
Ordinal analyses for monotone and cofinal transfinite inductions.Kentaro Sato - 2020 - Archive for Mathematical Logic 59 (3-4):277-291.
Bruno Scarpellini. Proof theory and intuitionistic systems. Lecture notes in mathematics, no. 212. Springer-Verlag, Berlin, Heidelberg, and New York, 1971, VII + 291 pp. [REVIEW]A. S. Troelstra - 1974 - Journal of Symbolic Logic 39 (3):607-609.
L -Σ n1 transfinite induction with an application to the EHP hierarchy.Eliot D. Feldman - 1975 - Mathematical Logic Quarterly 21 (1):463-471.
Paris-Harrington principles, reflection principles and transfinite induction up to epsilon 0.Reijiro Kurata - 1986 - Annals of Pure and Applied Logic 31:237.
Some combinatorial principles equivalent to restrictions of transfinite induction up to "GAMMA"0.R. Kurata - 1989 - Annals of Pure and Applied Logic 44 (1/2):63.

Analytics

Added to PP
2014-01-17

Downloads
30 (#550,221)

6 months
5 (#711,233)

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.
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
The Quantum Strategy of Completeness: On the Self-Foundation of Mathematics.Vasil Penchev - 2020 - Cultural Anthropology eJournal (Elsevier: SSRN) 5 (136):1-12.

View all 8 citations / 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