No CrossRef data available.
Article contents
Andreas Weiermann. Complexity bounds for some finite forms of Kruskal's Theorem. Journal of Symbolic Computation, vol. 18 (1994), 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 (1995), pp. 355–362. - Andreas Weiermann. Bounding derivation lengths with functions from the slow growing hierarchy. Archive of Mathematical Logic, vol. 37 (1998), pp. 427–441.
Published online by Cambridge University Press: 15 January 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS1079898600003693/resource/name/firstPage-S1079898600003693a.jpg)
- Type
- Reviews
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2004