Sometimes Slow Growing Is Fast Growing

Bulletin of Symbolic Logic 6 (2):222-223 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/421212

Links

PhilArchive



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

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

Review: Andreas Weiermann, Sometimes Slow Growing Is Fast Growing. [REVIEW]Martin Ruckert - 2000 - Bulletin of Symbolic Logic 6 (2):222-223.
Sometimes slow growing is fast growing.Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 90 (1-3):91-99.
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.
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.
Slow growing versus fast growing.S. S. Wainer - 1989 - Journal of Symbolic Logic 54 (2):608-614.
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.
Andreas Weiermann. How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study. The journal of symbolic logic, vol. 63 (1998), pp. 1348–1370. [REVIEW]Thomas Strahm - 2002 - Bulletin of Symbolic Logic 8 (3):435-436.
Andreas Weiermann. How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study. The journal of symbolic logic, vol. 63 (1998), pp. 1348–1370. [REVIEW]Thomas Strahm - 2002 - Bulletin of Symbolic Logic 8 (3):435-435.
Andreas Weiermann. An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discrete Mathematics and Theoretical Computer Science, vol. 6 no. 1 , pp. 133–141. [REVIEW]Albert A. Mullin - 2005 - Bulletin of Symbolic Logic 11 (1):89-89.

Analytics

Added to PP
2017-02-22

Downloads
9 (#1,269,748)

6 months
9 (#439,104)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references