Andreas Weiermann

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 11

Top Topics

Computer Science

Sequential Patterns

Top Venues

Arch. Math. Log.

Bull. Symb. Log.

Publications

David Fernández-Duque, Andreas Weiermann
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal. Ann. Pure Appl. Log. 175 (8) (2024)
David Fernández-Duque, Andreas Weiermann
A Walk with Goodstein. Bull. Symb. Log. 30 (1) (2024)
Junqing Huang, Haihui Wang, Andreas Weiermann, Michael V. Ruzhansky
Optimal Image Transport on Sparse Dictionaries. CoRR (2023)
David Fernández-Duque, Joost J. Joosten, Fedor Pakhomov, Konstnatinos Papafilippou, Andreas Weiermann
Arithmetical and Hyperarithmetical Worm Battles. J. Log. Comput. 32 (8) (2022)
Toshiyasu Arai, Stanley S. Wainer, Andreas Weiermann
Goodstein sequences based on a Parametrized Ackermann-Péter function. Bull. Symb. Log. 27 (2) (2021)
David Fernández-Duque, Andreas Weiermann
Ackermannian Goodstein Sequences of Intermediate Growth. CiE (2020)
Anton Freund, Michael Rathjen, Andreas Weiermann
Minimal bad sequences are necessary for a uniform Kruskal theorem. CoRR (2020)
Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann
An order-theoretic characterization of the Howard-Bachmann-hierarchy. Arch. Math. Log. 56 (1-2) (2017)
Michael Rathjen, Jeroen Van der Meeren, Andreas Weiermann
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition. Arch. Math. Log. 56 (5-6) (2017)
Andrey Bovykin, Andreas Weiermann
The strength of infinitary Ramseyan principles can be accessed by their densities. Ann. Pure Appl. Log. 168 (9) (2017)
Jean Goubault-Larrecq, Monika Seisenberger, Victor L. Selivanov, Andreas Weiermann
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports 6 (1) (2016)
Jeroen Van der Meeren, Andreas Weiermann
How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems. CiE (2015)
Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann
Well-partial-orderings and the big Veblen number. Arch. Math. Log. 54 (1-2) (2015)
Michiel De Smet, Andreas Weiermann
Phase Transitions Related to the Pigeonhole Principle. CiE (2014)
Sy-David Friedman, Michael Rathjen, Andreas Weiermann
Slow consistency. Ann. Pure Appl. Log. 164 (3) (2013)
Andreas Weiermann, Gunnar Wilken
Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0. Ann. Pure Appl. Log. 164 (12) (2013)
Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann
Streamlined subrecursive degree theory. Ann. Pure Appl. Log. 163 (6) (2012)
Michiel De Smet, Andreas Weiermann
Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. Ann. Pure Appl. Log. 163 (6) (2012)
Lew Gordeev, Andreas Weiermann
Phase transitions of iterated Higman-style well-partial-orderings. Arch. Math. Log. 51 (1-2) (2012)
Dimiter Skordev, Andreas Weiermann, Ivan Georgiev
-computable real numbers. J. Log. Comput. 22 (4) (2012)
Gunnar Wilken, Andreas Weiermann
Derivation Lengths Classification of Gödel's T Extending Howard's Assignment Log. Methods Comput. Sci. 8 (1) (2012)
Andreas Weiermann, Alan R. Woods
Some Natural Zero One Laws for Ordinals Below ε 0. CiE (2012)
Michiel De Smet, Andreas Weiermann
Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences. J. Log. Comput. 22 (2) (2012)
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
Sharp thresholds for hypergraph regressive Ramsey numbers. J. Comb. Theory, Ser. A 118 (2) (2011)
Andreas Weiermann, Gunnar Wilken
Ordinal arithmetic with simultaneously defined theta-functions. Math. Log. Q. 57 (2) (2011)
Michiel De Smet, Andreas Weiermann
A Miniaturisation of Ramsey's Theorem. CiE (2010)
Andreas Weiermann
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. CiE (2009)
Andreas Weiermann
Phase transitions for Gödel incompleteness. Ann. Pure Appl. Log. 157 (2-3) (2009)
Eran Omri, Andreas Weiermann
Classifying the phase transition threshold for Ackermannian functions. Ann. Pure Appl. Log. 158 (3) (2009)
Gunnar Wilken, Andreas Weiermann
Complexity of Gödel's T in lambda-Formulation. TLCA (2009)
Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. J. Comb. Theory, Ser. A 115 (6) (2008)
Michiel De Smet, Andreas Weiermann
Phase Transitions for Weakly Increasing Sequences. CiE (2008)
Henryk Kotlarski, Bozena Piekart, Andreas Weiermann
More on lower bounds for partitioning alpha-large sets. Ann. Pure Appl. Log. 147 (3) (2007)
Andreas Weiermann
Phase transition thresholds for some Friedman-style independence results. Math. Log. Q. 53 (1) (2007)
Arnoud den Boer, Andreas Weiermann
A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions. J. Log. Comput. 17 (6) (2007)
Andreas Weiermann
An extremely sharp phase transition threshold for the slow growing hierarchy. Math. Struct. Comput. Sci. 16 (5) (2006)
Andreas Weiermann
Classifying the Provably Total Functions of PA. Bull. Symb. Log. 12 (2) (2006)
Andreas Weiermann
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. CiE (2006)
Andreas Weiermann
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. Ann. Pure Appl. Log. 136 (1-2) (2005)
Georg Moser, Andreas Weiermann
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA (2003)
Andreas Weiermann
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discret. Math. Theor. Comput. Sci. 6 (1) (2003)
Andreas Weiermann
An application of graphical enumeration to PA*. J. Symb. Log. 68 (1) (2003)
Andreas Weiermann
Slow Versus Fast Growing. Synth. 133 (1-2) (2002)
Andreas Weiermann
May Be Minimal Subrecursively Inaccessible. Math. Log. Q. 47 (3) (2001)
Andreas Weiermann
Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function. J. Symb. Log. 66 (2) (2001)
Arnold Beckmann, Andreas Weiermann
Via Expanded Head Reduction Trees. Math. Log. Q. 46 (4) (2000)
Arnold Beckmann, Andreas Weiermann
Characterizing the elementary recursive functions by a fragment of Gödel's T. Arch. Math. Log. 39 (7) (2000)
Benjamin Blankertz, Andreas Weiermann
A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems. Stud Logica 62 (3) (1999)
Andreas Weiermann
Bounding derivation lengths with functions from the slow growing hierarchy. Arch. Math. Log. 37 (5-6) (1998)
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) (1998)
Andreas Weiermann
Sometimes Slow Growing is Fast Growing. Ann. Pure Appl. Log. 90 (1-3) (1997)
Andreas Weiermann
T by methods from local predicativity. Arch. Math. Log. 36 (6) (1997)
E. A. Cichon, Andreas Weiermann
Term Rewriting Theory for the Primitive Recursive Functions. Ann. Pure Appl. Log. 83 (3) (1997)
Arnold Beckmann, Andreas Weiermann
A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Log. 36 (1) (1996)
Andreas Weiermann
How to Characterize Provably Total Functions by Local Predicativity. J. Symb. Log. 61 (1) (1996)
Andreas Weiermann
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. Arch. Math. Log. 34 (5) (1995)
Andreas Weiermann
Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. Theor. Comput. Sci. 139 (1&2) (1995)
Andreas Weiermann
A Functorial Property of the Aczel-Buchholz-Feferman Function. J. Symb. Log. 59 (3) (1994)
Adam Cichon, Wilfried Buchholz, Andreas Weiermann
A Uniform Approach to Fundamental Sequences and Hierarchies. Math. Log. Q. 40 (1994)
Andreas Weiermann
Complexity Bounds for Some Finite Forms of Kruskal's Theorem. J. Symb. Comput. 18 (5) (1994)
Andreas Weiermann
A Simplified Functorial Construction of the Veblen Hierarchy. Math. Log. Q. 39 (1993)
Andreas Weiermann
An Order-Theoretic Characterization of the Schütte-Veblen-Hierarchy. Math. Log. Q. 39 (1993)
Andreas Weiermann
Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions. J. Symb. Log. 58 (2) (1993)
Michael Rathjen, Andreas Weiermann
Proof-Theoretic Investigations on Kruskal's Theorem. Ann. Pure Appl. Log. 60 (1) (1993)
Andreas Weiermann
Vereinfachte Kollabierungsfunktionen und ihre Anwendungen. Arch. Math. Log. 31 (2) (1991)
Andreas Weiermann
Proving Termination for Term Rewriting Systems. CSL (1991)