Andreas Weiermann
Orcid: 0000-0002-5561-5323
According to our database1,
Andreas Weiermann
authored at least 66 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Ann. Pure Appl. Log., 2024
2023
2022
2021
Bull. Symb. Log., 2021
2020
Proceedings of the Beyond the Horizon of Computability, 2020
2017
Ann. Pure Appl. Log., 2017
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition.
Arch. Math. Log., 2017
Arch. Math. Log., 2017
2016
Dagstuhl Reports, 2016
2015
How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015
2014
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014
2013
Ann. Pure Appl. Log., 2013
2012
J. Log. Comput., 2012
Log. Methods Comput. Sci., 2012
Ann. Pure Appl. Log., 2012
Arch. Math. Log., 2012
Proceedings of the How the World Computes, 2012
2011
2010
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010
2009
Ann. Pure Appl. Log., 2009
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009
Proceedings of the Mathematical Theory and Computational Practice, 2009
2008
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers.
J. Comb. Theory A, 2008
Proceedings of the Logic and Theory of Algorithms, 2008
2007
Math. Log. Q., 2007
J. Log. Comput., 2007
2006
Math. Struct. Comput. Sci., 2006
Proceedings of the Logical Approaches to Computational Barriers, 2006
2005
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results.
Ann. Pure Appl. Log., 2005
2003
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.
Discret. Math. Theor. Comput. Sci., 2003
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003
2002
2001
Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function.
J. Symb. Log., 2001
2000
Arch. Math. Log., 2000
1999
A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems.
Stud Logica, 1999
1998
How Is It that Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study.
J. Symb. Log., 1998
Arch. Math. Log., 1998
1997
Ann. Pure Appl. Log., 1997
A proof of strongly uniform termination for Gödel's <i>T</i>T by methods from local predicativity.
Arch. Math. Log., 1997
1996
J. Symb. Log., 1996
A term rewriting characterization of the polytime functions and related complexity classes.
Arch. Math. Log., 1996
1995
Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths.
Theor. Comput. Sci., 1995
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones.
Arch. Math. Log., 1995
1994
1993
Math. Log. Q., 1993
J. Symb. Log., 1993
1991
Proceedings of the Computer Science Logic, 5th Workshop, 1991