Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive Definitions

, &
Journal of Symbolic Logic 48 (3):878 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273488

Other Versions

original Buchholz, W.; Pohlers, W. (1978) "Provable wellorderings of formal theories for transfinitely iterated inductive definitions". Journal of Symbolic Logic 43(1):118-125

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

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

Provable wellorderings of formal theories for transfinitely iterated inductive definitions.W. Buchholz & W. Pohlers - 1978 - Journal of Symbolic Logic 43 (1):118-125.
Ordinals connected with formal theories for transfinitely iterated inductive definitions.W. Pohlers - 1978 - Journal of Symbolic Logic 43 (2):161-182.
S. Feferman and W. Sieg Inductive definitions and subsystems of analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 16–77. - Solomon Feferman and Wilfried Sieg. Proof theoretic equivalences between classical and constructive theories for analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 78–142. - Solomon Feferman. Iterated inductive fixed-point theories: application to Hancock's conjecture. Patras logic symposion, Proceedings of the logic symposion held at Patras, Greece, August 18–22, 1980, edited by George Metakides, Studies in logic. [REVIEW]Helmut Pfeiffer - 1994 - Journal of Symbolic Logic 59 (2):668-670.
Review: W. Pohlers, Cut-Elimination for Impredicative Infinitary Systems. Part I. Ordinal- Analysis for $ID_1$; W. Pohlers, Cut Elimination for Impredicative Infinitary Systems. Part II. Ordinal Analysis for Iterated Inductive Definitions. [REVIEW]Kurt Schutte - 1983 - Journal of Symbolic Logic 48 (3):879-880.
A slow growing analogue to buchholz' proof.Toshiyasu Arai - 1991 - Annals of Pure and Applied Logic 54 (2):101-120.
Wilfried Buchholz and Kurt Schütte. Proof theory of impredicative subsystems of analysis. Studies in proof theory. Bibliopolis, Naples1988, 122 pp. [REVIEW]Gerhard Jäger - 1991 - Journal of Symbolic Logic 56 (1):332-333.
The proof-theoretic analysis of transfinitely iterated fixed point theories.Gerhard Jager, Reinhard Kahle, Anton Setzer & Thomas Strahm - 1999 - Journal of Symbolic Logic 64 (1):53-67.
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.
Generalizations of the Kruskal-Friedman theorems.L. Gordeev - 1990 - Journal of Symbolic Logic 55 (1):157-181.

Analytics

Added to PP
2013-11-03

Downloads
114 (#188,964)

6 months
21 (#142,286)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Wolfram Pohlers
University of Muenster

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references