More download options

The slow-growing and the grzecorczyk hierarchies

E. A. Cichon & S. S. Wainer

Journal of Symbolic Logic 48 (2):399-408 (1983) Copy BIBT_EX

Abstract

This article has no associated abstract. (fix it)

Cite

Plain text

BibTeX

Formatted text

Reference Manager

RefWorks

Options

Mark as duplicate

Find it on Scholar

Request removal from index

Revision history

Categories

Logic and Philosophy of Logic

Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic

Keywords

Reprint years

DOI

10.2307/2273557

Other Versions

No versions found

Links

PhilArchive

Upload a copy of this work Papers currently archived: 100,290

External links

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

Through your library

Sign in / register and customize your OpenURL resolver
Configure custom resolver

My notes

Sign in to use this feature

Similar books and articles

Matt Fairtlough and Stanley S. Wainer. Hierarchies of provably recursive functions. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 149–207. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):466-467.

Slow versus fast growing.Andreas Weiermann - 2002 - Synthese 133 (1-2):13 - 29.

Kleene S. C.. Hierarchies of number-theoretic predicates. Bulletin of the American Mathematical Society, Bd. 61 , S. 193–213. [REVIEW]Werner Markwald - 1956 - Journal of Symbolic Logic 21 (4):411-412.

Slow growing versus fast growing.S. S. Wainer - 1989 - Journal of Symbolic Logic 54 (2):608-614.

Solomon Feferman. Classifications of recursive functions by means of hierarchies. Transactions of the American Mathematical Society, Bd. 104 , S. 101–122. [REVIEW]Rózsa Péter - 1965 - Journal of Symbolic Logic 30 (3):388-389.

The" Slow-Growing" U\ Approach to Hierarchies.S. S. Wainer - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--487.

Program Transformation and Proof Transformation.Wilfried Sieg & Stanley S. Wainer - unknown

Andreas Weiermann. Sometimes slow growing is fast growing. Annals of pure and applied logic, vol. 90 (1997) pp. 91–99.Martin Ruckert - 2000 - Bulletin of Symbolic Logic 6 (2):222-223.

Analytics

Added to PP
2009-01-28

Downloads
29 (#764,401)

6 months
5 (#1,013,651)

Historical graph of downloads

How can I increase my downloads?

Citations of this work

Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.

Slow consistency.Sy-David Friedman, Michael Rathjen & Andreas Weiermann - 2013 - Annals of Pure and Applied Logic 164 (3):382-393.

What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory.Jean H. Gallier - 1991 - Annals of Pure and Applied Logic 53 (3):199-260.

Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.

Goodstein Sequences Based on a Parametrized Ackermann–Péter Function.Toshiyasu Arai, Stanley S. Wainer & Andreas Weiermann - 2021 - Bulletin of Symbolic Logic 27 (2):168-186.

View all 15 citations / Add more citations

References found in this work

Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75-219.

Hierarchies of number-theoretic functions II.M. H. Löb & S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (3-4):97-113.

Add more references