Some variations of the Hardy hierarchy

Mathematical Logic Quarterly 51 (4):417 (2005)
  Copy   BIBTEX


We study some variations of the so-called Hardy hierarchy of quickly growing functions, known from the literature, and obtain analogues of Ratajczyk's approximation lemma for them



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles


Added to PP

26 (#145,883)

6 months
6 (#1,472,471)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
Inductive Full Satisfaction Classes.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Annals of Pure and Applied Logic 47 (1):199--223.

View all 8 references / Add more references