Proving Termination for Term Rewriting Systems. - Andreas Weiermann (CSL, 1991)

Vereinfachte Kollabierungsfunktionen und ihre Anwendungen. - Andreas Weiermann (Arch. Math. Log., 1991)

Proof-Theoretic Investigations on Kruskal's Theorem. - Michael Rathjen; Andreas Weiermann (Ann. Pure Appl. Log., 1993)

Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions. - Andreas Weiermann (J. Symb. Log., 1993)

A Simplified Functorial Construction of the Veblen Hierarchy. - Andreas Weiermann (Math. Log. Q., 1993)

An Order-Theoretic Characterization of the Schütte-Veblen-Hierarchy. - Andreas Weiermann (Math. Log. Q., 1993)

Complexity Bounds for Some Finite Forms of Kruskal's Theorem. - Andreas Weiermann (J. Symb. Comput., 1994)

A Functorial Property of the Aczel-Buchholz-Feferman Function. - Andreas Weiermann (J. Symb. Log., 1994)

A Uniform Approach to Fundamental Sequences and Hierarchies. - Adam Cichon; Wilfried Buchholz; Andreas Weiermann (Math. Log. Q., 1994)

Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. - Andreas Weiermann (Arch. Math. Log., 1995)

Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. - Andreas Weiermann (Theor. Comput. Sci., 1995)

A term rewriting characterization of the polytime functions and related complexity classes. - Arnold Beckmann; Andreas Weiermann (Arch. Math. Log., 1996)

How to Characterize Provably Total Functions by Local Predicativity. - Andreas Weiermann (J. Symb. Log., 1996)

A proof of strongly uniform termination for Gödel's TT by methods from local predicativity. - Andreas Weiermann (Arch. Math. Log., 1997)

Term Rewriting Theory for the Primitive Recursive Functions. - E. A. Cichon; Andreas Weiermann (Ann. Pure Appl. Log., 1997)

Sometimes Slow Growing is Fast Growing. - Andreas Weiermann (Ann. Pure Appl. Log., 1997)

Bounding derivation lengths with functions from the slow growing hierarchy. - Andreas Weiermann (Arch. Math. Log., 1998)

How Is It that Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. - Andreas Weiermann (J. Symb. Log., 1998)

A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems. - Benjamin Blankertz; Andreas Weiermann (Stud Logica, 1999)

Characterizing the elementary recursive functions by a fragment of Gödel's T. - Arnold Beckmann; Andreas Weiermann (Arch. Math. Log., 2000)

Analyzing Gödel's T Via Expanded Head Reduction Trees. - Arnold Beckmann; Andreas Weiermann (Math. Log. Q., 2000)

Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function. - Andreas Weiermann (J. Symb. Log., 2001)

Gamma0 May Be Minimal Subrecursively Inaccessible. - Andreas Weiermann (Math. Log. Q., 2001)

Slow Versus Fast Growing. - Andreas Weiermann (Synth., 2002)

Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. - Georg Moser; Andreas Weiermann (RTA, 2003)

An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. - Andreas Weiermann (Discret. Math. Theor. Comput. Sci., 2003)

An application of graphical enumeration to PA*. - Andreas Weiermann (J. Symb. Log., 2003)

Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. - Andreas Weiermann (Ann. Pure Appl. Log., 2005)

Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. - Andreas Weiermann (CiE, 2006)

Classifying the Provably Total Functions of PA. - Andreas Weiermann (Bull. Symb. Log., 2006)

An extremely sharp phase transition threshold for the slow growing hierarchy. - Andreas Weiermann (Math. Struct. Comput. Sci., 2006)

More on lower bounds for partitioning alpha-large sets. - Henryk Kotlarski; Bozena Piekart; Andreas Weiermann (Ann. Pure Appl. Log., 2007)

A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions. - Arnoud V. den Boer; Andreas Weiermann (J. Log. Comput., 2007)

Phase transition thresholds for some Friedman-style independence results. - Andreas Weiermann (Math. Log. Q., 2007)

Phase Transitions for Weakly Increasing Sequences. - Michiel De Smet; Andreas Weiermann (CiE, 2008)

Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. - Menachem Kojman; Gyesik Lee; Eran Omri; Andreas Weiermann (J. Comb. Theory A, 2008)

A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. - Andreas Weiermann (CiE, 2009)

Complexity of Gödel's T in lambda-Formulation. - Gunnar Wilken; Andreas Weiermann (TLCA, 2009)

Classifying the phase transition threshold for Ackermannian functions. - Eran Omri; Andreas Weiermann (Ann. Pure Appl. Log., 2009)

Phase transitions for Gödel incompleteness. - Andreas Weiermann (Ann. Pure Appl. Log., 2009)

A Miniaturisation of Ramsey's Theorem. - Michiel De Smet; Andreas Weiermann (CiE, 2010)

Sharp thresholds for hypergraph regressive Ramsey numbers. - Lorenzo Carlucci; Gyesik Lee; Andreas Weiermann (J. Comb. Theory A, 2011)

Ordinal arithmetic with simultaneously defined theta-functions. - Andreas Weiermann; Gunnar Wilken (Math. Log. Q., 2011)

Some Natural Zero One Laws for Ordinals Below ε 0. - Andreas Weiermann; Alan R. Woods (CiE, 2012)

Phase transitions of iterated Higman-style well-partial-orderings. - Lew Gordeev; Andreas Weiermann (Arch. Math. Log., 2012)

Streamlined subrecursive degree theory. - Lars Kristiansen; Jan-Christoph Schlage-Puchta; Andreas Weiermann (Ann. Pure Appl. Log., 2012)

Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. - Michiel De Smet; Andreas Weiermann (Ann. Pure Appl. Log., 2012)

Derivation Lengths Classification of Gödel's T Extending Howard's Assignment - Gunnar Wilken; Andreas Weiermann (Log. Methods Comput. Sci., 2012)

M2-computable real numbers. - Dimiter Skordev; Andreas Weiermann; Ivan Georgiev (J. Log. Comput., 2012)

Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences. - Michiel De Smet; Andreas Weiermann (J. Log. Comput., 2012)

Slow consistency. - Sy-David Friedman; Michael Rathjen; Andreas Weiermann (Ann. Pure Appl. Log., 2013)

Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0. - Andreas Weiermann; Gunnar Wilken (Ann. Pure Appl. Log., 2013)

Phase Transitions Related to the Pigeonhole Principle. - Michiel De Smet; Andreas Weiermann (CiE, 2014)

How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems. - Jeroen Van der Meeren; Andreas Weiermann (CiE, 2015)

Well-partial-orderings and the big Veblen number. - Jeroen Van der Meeren; Michael Rathjen; Andreas Weiermann (Arch. Math. Log., 2015)

Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). - Jean Goubault-Larrecq; Monika Seisenberger; Victor L. Selivanov; Andreas Weiermann (Dagstuhl Reports, 2016)

An order-theoretic characterization of the Howard-Bachmann-hierarchy. - Jeroen Van der Meeren; Michael Rathjen; Andreas Weiermann (Arch. Math. Log., 2017)

Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition. - Michael Rathjen; Jeroen Van der Meeren; Andreas Weiermann (Arch. Math. Log., 2017)

The strength of infinitary Ramseyan principles can be accessed by their densities. - Andrey Bovykin; Andreas Weiermann (Ann. Pure Appl. Log., 2017)

Ackermannian Goodstein Sequences of Intermediate Growth. - David Fernández-Duque; Andreas Weiermann (CiE, 2020)

Minimal bad sequences are necessary for a uniform Kruskal theorem. - Anton Freund; Michael Rathjen; Andreas Weiermann (CoRR, 2020)

Goodstein sequences based on a Parametrized Ackermann-Péter function. - Toshiyasu Arai; Stanley S. Wainer; Andreas Weiermann (Bull. Symb. Log., 2021)

Arithmetical and Hyperarithmetical Worm Battles. - David Fernández-Duque; Joost J. Joosten; Fedor Pakhomov; Konstantinos Papafilippou; Andreas Weiermann (J. Log. Comput., 2022)

Optimal Image Transport on Sparse Dictionaries. - Junqing Huang; Haihui Wang; Andreas Weiermann; Michael V. Ruzhansky (CoRR, 2023)

Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal. - David Fernández-Duque; Andreas Weiermann (Ann. Pure Appl. Log., 2024)

A Walk with Goodstein. - David Fernández-Duque; Andreas Weiermann (Bull. Symb. Log., 2024)