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: 91,752

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

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.
Review: Wilfried Buchholz, Notation Systems for Infinitary Derivations ; Wilfried Buchholz, Explaining Gentzen's Consistency Proof within Infinitary Proof Theory ; Sergei Tupailo, Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals. [REVIEW]Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
Three papers on proof theory.W. Buchholz, S. Tupailo & Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-438.
A direct independence proof of Buchholz's Hydra Game on finite labeled trees.Masahiro Hamano & Mitsuhiro Okada - 1998 - Archive for Mathematical Logic 37 (2):67-89.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
A Buchholz Rule for Modal Fixed Point Logics.Gerhard Jäger & Thomas Studer - 2011 - Logica Universalis 5 (1):1-19.
Bounding derivation lengths with functions from the slow growing hierarchy.Andreas Weiermann - 1998 - Archive for Mathematical Logic 37 (5-6):427-441.
A lexicographic path order with slow growing derivation bounds.Naohi Eguchi - 2009 - Mathematical Logic Quarterly 55 (2):212-224.
Slow versus fast growing.Andreas Weiermann - 2002 - Synthese 133 (1-2):13 - 29.
Three papers on proof theory by W. Buchholz and by S. Tupailo.T. Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-438.
Slow growing versus fast growing.S. S. Wainer - 1989 - Journal of Symbolic Logic 54 (2):608-614.
Sometimes slow growing is fast growing.Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 90 (1-3):91-99.

Analytics

Added to PP
2014-01-16

Downloads
23 (#679,329)

6 months
9 (#302,300)

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 11 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