-definable inductive definitions - PhilPapers" /> -definable inductive definitions. Annals of Pure and Applied Logic 156 (1):160-169. "> }-Definable Inductive Definitions}, volume = {156}, year = {2008} } ">

Ordinal analysis of non-monotone http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007208000924-si1. gif"/>-definable inductive definitions [Book Review]

Annals of Pure and Applied Logic 156 (1):160-169 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2008.06.014

Other Versions

No versions found

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

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.
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories.Gerhard Jäger & Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (8):647-660.
Weak axioms of determinacy and subsystems of analysis II.Kazuyuki Tanaka - 1991 - Annals of Pure and Applied Logic 52 (1-2):181-193.
Arnold Beckmann and Wolfram Pohlers. Applications of cut-free infinitary derivations to generalized recursion theory. Annals of pure and applied logic, vol. 94 , pp. 7–19. [REVIEW]Dag Normann - 2000 - Bulletin of Symbolic Logic 6 (2):221-222.
Abhisheka 1.Jan-Ulrich Sobisch - forthcoming - Http://Dgongs1. Com.
Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators.Toshiyasu Arai - 2010 - Annals of Pure and Applied Logic 162 (2):107-143.
On the proof-theoretic strength of monotone induction in explicit mathematics.Thomas Glaß, Michael Rathjen & Andreas Schlüter - 1997 - Annals of Pure and Applied Logic 85 (1):1-46.
Δ0-complexity of the relation y = Πi ⩽ nF.Alessandro Berarducci & Paola D'Aquino - 1995 - Annals of Pure and Applied Logic 75 (1):49-56.
Ordinal analysis by transformations.Henry Towsner - 2009 - Annals of Pure and Applied Logic 157 (2-3):269-280.

Analytics

Added to PP
2013-12-26

Downloads
89 (#235,672)

6 months
13 (#257,195)

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

Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.
Subsystems of set theory and second order number theory.Wolfram Pohlers - 1998 - In Samuel R. Buss (ed.), Handbook of proof theory. New York: Elsevier. pp. 137--209.

View all 6 references / Add more references