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 [Book Review]

Bulletin of Symbolic Logic 10 (4):588-590 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600003693

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,953

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

Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the polytime functions. Computational complexity, vol. 2 , pp. 97–110. - Arnold Beckmann and Andreas Weiermann. A term rewriting characterization of the polytime functions and related complexity classes. Archive for mathematical logic, vol. 36 , pp. 11–30. [REVIEW]Karl-Heinz Niggl - 2000 - Bulletin of Symbolic Logic 6 (3):351-353.
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. 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.
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.
Review: Andreas Weiermann, Sometimes Slow Growing Is Fast Growing. [REVIEW]Martin Ruckert - 2000 - Bulletin of Symbolic Logic 6 (2):222-223.
A lexicographic path order with slow growing derivation bounds.Naohi Eguchi - 2009 - Mathematical Logic Quarterly 55 (2):212-224.
Bounding derivation lengths with functions from the slow growing hierarchy.Andreas Weiermann - 1998 - Archive for Mathematical Logic 37 (5-6):427-441.
A term rewriting characterization of the functions computable in polynomial space.Isabel Oitavem - 2002 - Archive for Mathematical Logic 41 (1):35-47.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.

Analytics

Added to PP
2019-05-07

Downloads
14 (#1,018,297)

6 months
3 (#1,045,430)

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