Andreas Weiermann
Andreas Weiermann
Professor für Mathematik, Logik und Informatik
Verified email at cage.ugent.be - Homepage
TitleCited byYear
Proof-theoretic investigations on Kruskal's theorem
M Rathjen, A Weiermann
Annals of Pure and applied Logic 60 (1), 49-88, 1993
1251993
A uniform approach to fundamental sequences and hierarchies
W Buchholz, A Cichon, A Weiermann
Mathematical Logic Quarterly 40 (2), 273-286, 1994
1001994
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
841995
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
521996
A classification of rapidly growing Ramsey functions
A Weiermann
Proceedings of the American Mathematical Society 132 (2), 553-561, 2004
512004
An application of graphical enumeration to PA
A Weiermann
The Journal of Symbolic Logic 68 (1), 5-16, 2003
502003
How to characterize provably total functions by local predicativity
A Weiermann
The Journal of Symbolic Logic 61 (1), 52-69, 1996
491996
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
402017
Term rewriting theory for the primitive recursive functions
EA Cichon, A Weiermann
Annals of pure and applied logic 83 (3), 199-223, 1997
391997
Complexity bounds for some finite forms of Kruskal's theorem
A Weiermann
Journal of Symbolic Computation 18 (5), 463-488, 1994
391994
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
362005
Phase transition thresholds for some Friedman‐style independence results
A Weiermann
Mathematical Logic Quarterly 53 (1), 4-18, 2007
292007
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
271998
How to characterize provably total functions by the Buchholz operator method
B Blankertz, A Weiermann
Gödel'96: Logical foundations of mathematics, computer science and physics …, 1996
251996
Classifying the provably total functions of PA
A Weiermann
Bulletin of Symbolic Logic 12 (2), 177-190, 2006
242006
Unprovability results involving braids
L Carlucci, P Dehornoy, A Weiermann
Proceedings of the London Mathematical Society 102 (1), 159-192, 2011
212011
Proving termination for term rewriting systems
A Weiermann
International Workshop on Computer Science Logic, 419-428, 1991
201991
Getting a purchase on AR
A Bodhani
Engineering & Technology 8 (4), 46-49, 2013
192013
Characterizing the elementary recursive functions by a fragment of Gödel's T
A Beckmann, A Weiermann
Archive for Mathematical Logic 39 (7), 475-491, 2000
192000
Slow consistency
SD Friedman, M Rathjen, A Weiermann
Annals of Pure and Applied Logic 164 (3), 382-393, 2013
182013
The system can't perform the operation now. Try again later.
Articles 1–20