Schriftenverzeichnis

ANDREAS WEIERMANN
Veröffentlichungen:
1. Vereinfachte Kollabierungsfunktionen und ihre Anwendungen, Archive for Mathematical Logic 31 (1991), 85-94.
2. Proving termination for term rewriting systems, Lecture Notes in Computer Science 626 (1992), 419-428.
3. Proof-theoretic investigations on Kruskal's theorem (zusammen mit M. Rathjen), Annals of Pure and Applied Logic 60 (1993), 49-88.
4. A simplified functorial construction of the Veblen hierarchy, Mathematical Logic Quarterly 39 (1993), 269-273.
5. An order-theoretic characterization of the Schütte-Veblen hierarchy, Mathematical Logic Quarterly 39 (1993), 367-383.
6. Bounds for the closure ordinals of essentially monotonic increasing functions, Journal of Symbolic Logic 58 (1993), 664-671.
7. A uniform approach to fundamental sequences and hierarchies (zusammen mit W. Buchholz und E. A. Cichon), Mathematical Logic Quarterly 40 (1994), 273-286.
8. A functorial property of the Aczel-Buchholz-Feferman-function, Journal of Symbolic Logic 59 (1994), 945-955.
9. Complexity bounds for some finite forms of Kruskal's theorem, Journal of Symbolic Computation 18 (1994), 463-488.
10. Termination proofs for term rewriting systems with lexicographic path orderings imply multiply recursive derivation lengths, Theoretical Computer Science 139 (1995), 355-362.
11. Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, Archive for Mathematical Logic 34 (1995), 313-330.
12. How to characterize provably total functions by local predicativity, Journal of Symbolic Logic 61 (1996), 52-69.
13. How to characterize provably total functions by the Buchholz operator
method (zusammen mit B. Blankertz). Springer Lecture Notes in Logic 6 (1996), 205-213.
14. A term rewriting characterization of the polytime functions and related complexity classes (zusammen mit A. Beckmann), Archive for Mathematical Logic 36 (1996), 11-30.
15. Term rewriting theory for the primitive recursive functions (zusammen mit E. A. Cichon), Annals of Pure and Applied Logic 83 (1997), 199-223.
16. A proof of strongly uniform termination for Gödel's $T$ by methods from local predicativity, Archive for Mathematical Logic 36 (1997), 445-460.
17. Sometimes slow growing is fast growing. Annals of Pure and Applied Logic 90 (1997), 91-99.
18. Bounding derivation lengths with functions from the slow growing hierarchy, Archive for Mathematical Logic 37 (1998), 427-441.
19. How is it that infinitary methods can be applied to finitary mathematics? Gödel's $T$: a case study, Journal of Symbolic Logic 63 (1998), 1348-1370.
20. A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems (zusammen mit B. Blankertz), Studia Logica 62 (1999), 399-427.
21. What makes a (pointwise) subrecursive hierarchy slow growing? London Mathematical Society: Sets and Proof, Cooper,Truss (eds.), Cambridge University Press (1999), 403-423.
22. Analyzing Goedel's T via expanded head reduction trees, Mathematical Logic Quarterly 46 (2000) 517-536. (zusammen mit A. Beckmann).
23. How to characterize the elementary recursive functions by Howard-Schütte-style methods, Archive for Mathematical Logic 39 (2000), 475-491 (zusammen mit A. Beckmann).
24. $\Gamma_0$ may be minimal subrecursively inaccessible. Mathematical Logic Quarterly 47 (2001) 397-408.
25. Some interesting connections between the slow growing hierarchy and the Ackermann function. The Journal of Symbolic Logic 66 (2001) 609-628.
26. Zero one law characterizations of $\epsilon_0$. Mathematics and Computer Science II. Proceedings of the Colloquium on Algorithms, Trees, Combinatorics and Probabilities. Birkhäuser (2002) 527-539.
27. Slow versus fast growing. Proceedings of the Foundations of the Formal Sciences. Synthese 133 (2002) 13-19
28. An application of graphical enumeration to $PA$. The Journal of Symbolic Logic 68 (2003) 5-16.
29 Relating derivation lengths with the slow-growing hierarchy directly. Proceedings of RTA 2003. (zusammen mit G. Moser)
30. An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discrete Mathematics and Theoretical Computer Science 6, 133-142 (2003).

Zur Veröffentlichung angenommene Artikel:
31. A classification of rapidly growing Ramsey functions. Proceedings of the Amer. Math. Soc. 132 (2004), 553-561. Available under http://www.ams.org/proc/2004-132-02/S0002-9939-03-07086-2/home.html.
32. A very slow growing hierarchy for $\Gamma_0$. Proceedings of LC 1999.