A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy

&
In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter. pp. 79-90 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1515/9783110324921.79

Links

PhilArchive



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

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

Andreas Weiermann. Complexity bounds for some finite forms of Kruskal's Theorem. Journal of Symbolic Computation, vol. 18 , pp. 463–448. - Andreas Weiermann. Termination proofs for term rewriting systems with lexicographic path ordering imply multiply recursive derivation lengths. Theoretical Computer Science, vol. 139 , pp. 355–362. - Andreas Weiermann. Bounding derivation lengths with functions from the slow growing hierarchy. Archive of Mathematical Logic, vol. 37 , pp. 427–441. [REVIEW]Georg Moser - 2004 - Bulletin of Symbolic Logic 10 (4):588-590.
Review: Andreas Weiermann, Sometimes Slow Growing Is Fast Growing. [REVIEW]Martin Ruckert - 2000 - Bulletin of Symbolic Logic 6 (2):222-223.
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.
On Wainer's notation for a minimal subrecursive inaccessible ordinal.Noriya Kadota - 1993 - Mathematical Logic Quarterly 39 (1):217-227.
Γ0 May Be Minimal Subrecursively Inaccessible.Andreas Weiermann - 2001 - Mathematical Logic Quarterly 47 (3):397-408.
Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
Sometimes slow growing is fast growing.Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 90 (1-3):91-99.
A slow growing analogue to buchholz' proof.Toshiyasu Arai - 1991 - Annals of Pure and Applied Logic 54 (2):101-120.
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.
A Hierarchy of Ramified Theories Below PRA.Elliott J. Spoors & Stanley S. Wainer - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter. pp. 475-500.

Analytics

Added to PP
2023-06-09

Downloads
4 (#1,645,937)

6 months
3 (#1,208,233)

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

No references found.

Add more references