An Upper Bound for the Provability of Transfinite Induction in Systems with N-Times 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/2273486

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

Induction and Inductive Definitions in Fragments of Second Order Arithmetic.Klaus Aehlig - 2005 - Journal of Symbolic Logic 70 (4):1087 - 1107.
Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive Definitions.Kurt Schutte, W. Buchholz & W. Pohlers - 1983 - Journal of Symbolic Logic 48 (3):878.
Type-theoretic interpretation of iterated, strictly positive inductive definitions.Erik Palmgren - 1992 - Archive for Mathematical Logic 32 (2):75-99.
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.
Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
Iterated local reflection versus iterated consistency.Lev Beklemishev - 1995 - Annals of Pure and Applied Logic 75 (1-2):25-48.
Ordinals connected with formal theories for transfinitely iterated inductive definitions.W. Pohlers - 1978 - Journal of Symbolic Logic 43 (2):161-182.
Generalizations of the Kruskal-Friedman theorems.L. Gordeev - 1990 - Journal of Symbolic Logic 55 (1):157-181.
Notes on some second-order systems of iterated inductive definitions and Π 1 1 -comprehensions and relevant subsystems of set theory. [REVIEW]Kentaro Fujimoto - 2015 - Annals of Pure and Applied Logic 166 (4):409-463.
Provable wellorderings of formal theories for transfinitely iterated inductive definitions.W. Buchholz & W. Pohlers - 1978 - Journal of Symbolic Logic 43 (1):118-125.
Epsilon substitution method for ID1.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 121 (2-3):163-208.
The proof theory of classical and constructive inductive definitions. A 40 year saga, 1968-2008.Solomon Feferman - unknown
There Are No Universal Rules for Induction.John D. Norton - 2010 - Philosophy of Science 77 (5):765-777.
Ordinal analysis of non-monotone-definable inductive definitions.Wolfram Pohlers - 2008 - Annals of Pure and Applied Logic 156 (1):160-169.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.

Analytics

Added to PP
2013-11-03

Downloads
76 (#214,281)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

Add more citations

References found in this work

No references found.

Add more references