Proof-theoretic investigations on Kruskal's theorem M Rathjen, A Weiermann
Annals of Pure and applied Logic 60 (1), 49-88, 1993
171 1993 A uniform approach to fundamental sequences and hierarchies W Buchholz, A Cichon, A Weiermann
Mathematical Logic Quarterly 40 (2), 273-286, 1994
118 1994 Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths A Weiermann
Theoretical Computer Science 139 (1-2), 355-362, 1995
92 1995 An application of graphical enumeration to PA A Weiermann
The Journal of Symbolic Logic 68 (1), 5-16, 2003
64 2003 A classification of rapidly growing Ramsey functions A Weiermann
Proceedings of the American Mathematical Society 132 (2), 553-561, 2004
62 2004 A term rewriting characterization of the polytime functions and related complexity classes A Beckmann, A Weiermann
Archive for Mathematical Logic 36 (1), 11-30, 1996
52 1996 How to characterize provably total functions by local predicativity A Weiermann
The Journal of Symbolic Logic 61 (1), 52-69, 1996
51 1996 The strength of infinitary Ramseyan principles can be accessed by their densities A Bovykin, A Weiermann
Annals of Pure and Applied Logic 168 (9), 1700-1709, 2017
48 2017 Complexity bounds for some finite forms of Kruskal's theorem A Weiermann
Journal of Symbolic Computation 18 (5), 463-488, 1994
45 1994 Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results A Weiermann
Annals of Pure and Applied Logic 136 (1-2), 189-218, 2005
44 2005 Term rewriting theory for the primitive recursive functions EA Cichon, A Weiermann
Annals of pure and applied logic 83 (3), 199-223, 1997
40 1997 Reverse mathematics and well-ordering principles M Rathjen, A Weiermann
Computability in Context: Computation and Logic in the Real World, 351-370, 2011
32 2011 Phase transition thresholds for some Friedman‐style independence results A Weiermann
Mathematical Logic Quarterly 53 (1), 4-18, 2007
32 2007 Classifying the provably total functions of PA A Weiermann
Bulletin of Symbolic Logic 12 (2), 177-190, 2006
32 2006 How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study A Weiermann
The Journal of Symbolic Logic 63 (4), 1348-1370, 1998
31 1998 Slow consistency SD Friedman, M Rathjen, A Weiermann
Annals of Pure and Applied Logic 164 (3), 382-393, 2013
28 2013 A computation of the maximal order type of the term ordering on finite multisets A Weiermann
Mathematical Theory and Computational Practice: 5th Conference on …, 2009
25 2009 How to characterize provably total functions by the Buchholz operator method B Blankertz, A Weiermann
Lecture Notes in Logic 6, 205-213, 1996
25 1996 2 -computable real numbersD Skordev, A Weiermann, I Georgiev
Journal of Logic and Computation 22 (4), 899-925, 2012
24 2012 Proving termination for term rewriting systems A Weiermann
Computer Science Logic: 5th Workshop, CSL'91 Berne, Switzerland, October 7 …, 1992
24 1992 