A slow growing analogue to buchholz' proof

Annals of Pure and Applied Logic 54 (2):101-120 (1991)
  Copy   BIBTEX

Abstract

In this, journal, W. Buchholz gave an elegant proof of a characterization theorem for provably total recursive functions in the theory IDv for the v-times iterated inductive definitions . He characterizes the classes of functions by Hardy functions. In this note we will show that a slow growing analogue to the theorem can be obtained by a slight modification of Buchholz' proof

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(91)90027-j

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

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

ASH, CJ, Stability of recursive structures in arithmetical degrees BLASS, A. and GUREVICH, Y., Henkin quantifiers and complete problems BUCHHOLZ, W., A new system of proof-theoretic ordinal functions. [REVIEW]H. Friedman & Rc Flagg - 1986 - Annals of Pure and Applied Logic 32 (C):299.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Variations on a Theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
How to characterize provably total functions by local predicativity.Andreas Weiermann - 1996 - Journal of Symbolic Logic 61 (1):52-69.
A Buchholz Rule for Modal Fixed Point Logics.Gerhard Jäger & Thomas Studer - 2011 - Logica Universalis 5 (1):1-19.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
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.
A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. [REVIEW]Andreas Weiermann - 1995 - Archive for Mathematical Logic 34 (5):313-330.
Three papers on proof theory by W. Buchholz and by S. Tupailo.T. Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-438.

Analytics

Added to PP
2014-01-16

Downloads
24 (#155,087)

6 months
9 (#1,260,759)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof-theoretic analysis of termination proofs.Wilfried Buchholz - 1995 - Annals of Pure and Applied Logic 75 (1-2):57-65.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.

View all 12 citations / Add more citations

References found in this work

A new system of proof-theoretic ordinal functions.W. Buchholz - 1986 - Annals of Pure and Applied Logic 32:195-207.
An independence result for (II11-CA)+BI.Wilfried Buchholz - 1987 - Annals of Pure and Applied Logic 33 (C):131-155.

Add more references