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)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s1079898600003693
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 43,952
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Complexity Bounds for Some Finite Forms of Kruskal's Theorem.Andreas Weiermann - 2004 - Bulletin of Symbolic Logic 10 (4):588-590.
Term Rewriting Theory for the Primitive Recursive Functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
A Lexicographic Path Order with Slow Growing Derivation Bounds.Naohi Eguchi - 2009 - Mathematical Logic Quarterly 55 (2):212-224.
Variations on a Theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Term Rewriting Theory for the Primitive Recursive Functions. E. Cichon & A. Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Variations on a Theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Equational Derivation Vs. Computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.

Analytics

Added to PP index
2019-05-07

Total views
6 ( #949,948 of 2,266,516 )

Recent downloads (6 months)
1 ( #848,217 of 2,266,516 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature