Provable wellorderings of formal theories for transfinitely iterated inductive definitions

&
Journal of Symbolic Logic 43 (1):118-125 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271954

Other Versions

edition Schutte, Kurt; Buchholz, W.; Pohlers, W. (1983) "Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive Definitions". Journal of Symbolic Logic 48(3):878

Links

PhilArchive



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

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

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.
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.
A Buchholz Rule for Modal Fixed Point Logics.Gerhard Jäger & Thomas Studer - 2011 - Logica Universalis 5 (1):1-19.
Proof theory of iterated inductive definitions revisited.W. Buchholz - forthcoming - Archive for Mathematical Logic.

Analytics

Added to PP
2009-01-28

Downloads
59 (#362,045)

6 months
17 (#172,835)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Wolfram Pohlers
University of Muenster

Citations of this work

A new system of proof-theoretic ordinal functions.W. Buchholz - 1986 - Annals of Pure and Applied Logic 32:195-207.
A proof-theoretic account of classical principles of truth.Graham E. Leigh - 2013 - Annals of Pure and Applied Logic 164 (10):1009-1024.

View all 7 citations / Add more citations

References found in this work

Ein konstruktives system von Ordinalzahlen.Kurt Schütte - 1968 - Archive for Mathematical Logic 11 (3-4):126-137.
Ein Bezeichnungssystem für Ordinalzahlen.Helmut Pfeiffer - 1969 - Archive for Mathematical Logic 12 (1-2):12-17.
Ein Bezeichnungssystem für Ordinalzahlen.Helmut Pfeiffer - 1970 - Archive for Mathematical Logic 13 (1-2):74-90.

Add more references