| 2007 |
|---|
| 25 | EE | Henryk Kotlarski,
Bozena Piekart,
Andreas Weiermann:
More on lower bounds for partitioning alpha-large sets.
Ann. Pure Appl. Logic 147(3): 113-126 (2007) |
| 24 | EE | Arnoud den Boer,
Andreas Weiermann:
A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions.
J. Log. Comput. 17(6): 1083-1098 (2007) |
| 23 | EE | Andreas Weiermann:
Phase transition thresholds for some Friedman-style independence results.
Math. Log. Q. 53(1): 4-18 (2007) |
| 2006 |
|---|
| 22 | EE | Andreas Weiermann:
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions.
CiE 2006: 556-570 |
| 2005 |
|---|
| 21 | EE | Andreas Weiermann:
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results.
Ann. Pure Appl. Logic 136(1-2): 189-218 (2005) |
| 2003 |
|---|
| 20 | EE | Georg Moser,
Andreas Weiermann:
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.
RTA 2003: 296-310 |
| 19 | EE | Andreas Weiermann:
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.
Discrete Mathematics & Theoretical Computer Science 6(1): (2003) |
| 18 | | Andreas Weiermann:
An application of graphical enumeration to PA*.
J. Symb. Log. 68(1): 5-16 (2003) |
| 2001 |
|---|
| 17 | | Andreas Weiermann:
Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function.
J. Symb. Log. 66(2): 609-628 (2001) |
| 16 | EE | Andreas Weiermann:
Gamma0 May Be Minimal Subrecursively Inaccessible.
Math. Log. Q. 47(3): 397-408 (2001) |
| 2000 |
|---|
| 15 | EE | Arnold Beckmann,
Andreas Weiermann:
Analyzing Gödel's T Via Expanded Head Reduction Trees.
Math. Log. Q. 46(4): 517-536 (2000) |
| 1999 |
|---|
| 14 | | Benjamin Blankertz,
Andreas Weiermann:
A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems.
Studia Logica 62(3): 399-427 (1999) |
| 1998 |
|---|
| 13 | | Andreas Weiermann:
How Is It that Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study.
J. Symb. Log. 63(4): 1348-1370 (1998) |
| 1997 |
|---|
| 12 | | E. A. Cichon,
Andreas Weiermann:
Term Rewriting Theory for the Primitive Recursive Functions.
Ann. Pure Appl. Logic 83(3): 199-223 (1997) |
| 11 | | Andreas Weiermann:
Sometimes Slow Growing is Fast Growing.
Ann. Pure Appl. Logic 90(1-3): 91-99 (1997) |
| 1996 |
|---|
| 10 | | Andreas Weiermann:
How to Characterize Provably Total Functions by Local Predicativity.
J. Symb. Log. 61(1): 52-69 (1996) |
| 1995 |
|---|
| 9 | EE | Andreas Weiermann:
Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths.
Theor. Comput. Sci. 139(1&2): 355-362 (1995) |
| 1994 |
|---|
| 8 | | Andreas Weiermann:
Complexity Bounds for Some Finite Forms of Kruskal's Theorem.
J. Symb. Comput. 18(5): 463-488 (1994) |
| 7 | | Andreas Weiermann:
A Functorial Property of the Aczel-Buchholz-Feferman Function.
J. Symb. Log. 59(3): 945-955 (1994) |
| 6 | | Adam Cichon,
Wilfried Buchholz,
Andreas Weiermann:
A Uniform Approach to Fundamental Sequences and Hierarchies.
Math. Log. Q. 40: 273-286 (1994) |
| 1993 |
|---|
| 5 | | Michael Rathjen,
Andreas Weiermann:
Proof-Theoretic Investigations on Kruskal's Theorem.
Ann. Pure Appl. Logic 60(1): 49-88 (1993) |
| 4 | | Andreas Weiermann:
Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions.
J. Symb. Log. 58(2): 664-671 (1993) |
| 3 | | Andreas Weiermann:
A Simplified Functorial Construction of the Veblen Hierarchy.
Math. Log. Q. 39: 269-273 (1993) |
| 2 | | Andreas Weiermann:
An Order-Theoretic Characterization of the Schütte-Veblen-Hierarchy.
Math. Log. Q. 39: 367-383 (1993) |
| 1991 |
|---|
| 1 | | Andreas Weiermann:
Proving Termination for Term Rewriting Systems.
CSL 1991: 419-428 |
