Research Explorer

Your browser does not support JavaScript or JavaScript is not enabled. Without JavaScript some functions of this webapplication may be disabled or cause error messages. To enable JavaScript, please consult the manual of your browser or contact your system administrator.

Researcher

Andreas Weiermann

Publications & Research Data

Awards & Distinctions

109 Results

2026

Induction on dilators and Bachmann-Howard fixed points

Juan P. AguileraAnton FreundAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

2025

Gödel’s incompleteness at the frontiers of predicativity

Oriola GjetajAndreas WeiermannDavid Fernández-DuqueLorenzo Carlucci

Intuitionistic dynamic logic

Lukas Matthias ZengerAndreas WeiermannThomas studerDavid Fernández-Duque

Maximum linearizations of lower sets in N^m with application to monomial ideals

Harry AltmanAndreas Weiermann

A1 Journal Article in PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY

Modal combinatorics : unification, fixed-points, and reflection

Konstantinos PapafilippouDavid Fernández-DuqueAndreas WeiermannSeyedmojtaba MojtahediJuan Aguilera

2024

A walk with Goodstein

David Fernández-DuqueAndreas Weiermann

A1 Journal Article in BULLETIN OF SYMBOLIC LOGIC

A walk with Goodstein and Ackermann

David Fernández-DuqueAndreas Weiermann

A1 Journal Article in NOTRE DAME JOURNAL OF FORMAL LOGIC

Fast Goodstein walks

David Fernández-DuqueAndreas Weiermann

A1 Journal Article in BULLETIN OF THE LONDON MATHEMATICAL SOCIETY

Functorial fast-growing hierarchies

Juan P. AguileraFedor PakhomovAndreas Weiermann

A1 Journal Article in FORUM OF MATHEMATICS SIGMA

Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal

David Fernández-DuqueAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

Proof-theoretical aspects of well quasi-orders and phase transitions in arithmetical provability

Gabriele BuriolaPeter SchusterAndreas Weiermann

Well partial orders

Andreas Weiermann

Bookchapter in Dick de Jongh on Intuitionistic and Provability Logics

2023

Intermediate Goodstein principles

David Fernández-DuqueOriola GjetajAndreas Weiermann

Bookchapter in Mathematics for Computation (M4C)

Modern perspectives in Proof Theory

J. P. AguileraFedor PakhomovAndreas Weiermann

Editorial material

Some independence results related to finite trees

Harvey Martin FriedmanAndreas Weiermann

A1 Journal Article in PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES

2022

Arithmetical and hyperarithmetical worm battles

David Fernández-DuqueJoost J JoostenFedor PakhomovKonstantinos PapafilippouAndreas Weiermann

A1 Journal Article in JOURNAL OF LOGIC AND COMPUTATION

Boundedness theorems for flowers and sharps

J. P. AguileraAnton FreundMichael RathjenAndreas Weiermann

A1 Journal Article in PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY

Minimal bad sequences are necessary for a uniform Kruskal theorem

Anton FreundMichael RathjenAndreas Weiermann

A1 Journal Article in ADVANCES IN MATHEMATICS

2021

Ackermann and Goodstein go functorial

J. P. AguileraAnton FreundMichael RathjenAndreas Weiermann

A1 Journal Article in PACIFIC JOURNAL OF MATHEMATICS

Connecting with computability

Goodstein sequences on a parametrized Ackermann-Peter function

Toshiyasu AraiStan WainerAndreas Weiermann

A1 Journal Article in BULLETIN OF SYMBOLIC LOGIC

2020

Ackermannian Goodstein sequences of intermediate growth

David Fernández-DuqueAndreas Weiermann

Calculating maximal order types for finite rooted unstructured labeled trees

Diana SchmidtJeroen Van der MeerenAndreas Weiermann

Bookchapter in The legacy of Kurt Schütte

Predicatively unprovable termination of the Ackermannian Goodstein process

Toshiyasu AraiDavid Fernández-DuqueStanley WainerAndreas Weiermann

A1 Journal Article in PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY

Topological properties and asymptotic behavior of generalized functions

Lenny NeytJasson Vindas DiazAndreas Weiermann

Well-quasi orders in computation, logic, language and reasoning : a unifying concept of proof theory, automata theory, formal languages and descriptive set theory

2017

Ackermannian Goodstein principles for first order Peano arithmetic

Andreas Weiermann

Bookchapter in Sets and computations

An order-theoretic characterization of the Howard-Bachmann-hierarchy

Jeroen Van der MeerenMichael RathjenAndreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition

Michael RathjenJeroen Van der MeerenAndreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

The strength of infinitary Ramseyan principles can be accessed by their densities

Andrey BovykinAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

2015

Analytic estimates of class numbers and relative class numbers

Korneel DebaeneAndreas WeiermannJan-Christoph Schlage-Puchta

Beweisbar oder nicht? Die Grenzzahl 0,639578175...

Andreas WeiermannDirk Huylebrouck

A2 Journal Article in MITTEILUNGEN DER DEUTSCHEN MATHEMATIKER-VEREINIGUNG

Classifying phase transition thresholds for Goodstein sequences and Hydra games

Frederik MeskensAndreas Weiermann

Bookchapter in Gentzen's centenary : the quest for consistency

Connecting the two worlds: well-partial-orders and ordinal notation systems

Jeroen Van der MeerenAndreas Weiermann

How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems

Jeroen Van der MeerenAndreas Weiermann

Well-partial-orderings and the big Veblen number

Jeroen Van der MeerenMichael RathjenAndreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

2014

Asymptotic distribution of integers with certain prime factorizations

Hans VernaeveJasson Vindas DiazAndreas Weiermann

A1 Journal Article in JOURNAL OF NUMBER THEORY

Het grensgetal 0.639578175...

Andreas WeiermannDirk Huylebrouck

Phase transitions related to the pigeonhole principle

Michiel De SmetAndreas Weiermann

2013

Goodstein sequences for prominent ordinals up to the ordinal of Π¹₁-CA₀

Andreas WeiermannGunnar Wilken

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

On the structure of honest elementary degrees

Lars KristiansenRobert S LubarskyJan-Christoph Schlage-PuchtaAndreas Weiermann

Slow consistency

Sy-David FriedmanMichael RathjenAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

Some results on PA-provably recursive functions

Sy-David FriedmanMichael RathjenAndreas Weiermann

2012

A nonstandard hierarchy comparison theorem for the slow and fast growing hierarchy

Wilfried BuchholzAndreas Weiermann

Bookchapter in Logic, construction, computation

Connecting the provable with the unprovable: phase transitions for unprovability

Florian Nicolás PelupessyAndreas Weiermann

Derivation lengths classification of Gödel's T extending Howard's assignment

Gunnar WilkenAndreas Weiermann

A1 Journal Article in LOGICAL METHODS IN COMPUTER SCIENCE

Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal

Michiel De SmetAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

M2-computable real numbers

Dimiter SkordevAndreas WeiermannIvan Georgiev

A1 Journal Article in JOURNAL OF LOGIC AND COMPUTATION

On the lengths of bad sequences of monomial ideals over polynomial rings

Florian Nicolás PelupessyAndreas Weiermann

A1 Journal Article in FUNDAMENTA MATHEMATICAE

Phase transitions of iterated Higman-style well-partial-orderings

Lev GordeevAndreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension

Andreas WeiermannWim Van Hoof

A1 Journal Article in PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY

Sharp thresholds for a phase transition related to weakly increasing sequences

Michiel De SmetAndreas Weiermann

A1 Journal Article in JOURNAL OF LOGIC AND COMPUTATION

Some natural zero one laws for ordinals below ε0

Andreas WeiermannAlan R Woods

Streamlined subrecursive degree theory

Lars KristiansenJan-Christoph Schlage-PuchtaAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

2011

Ordinal arithmetic with simultaneously deﬁned theta-functions

Andreas WeiermannGunnar Wilken

A1 Journal Article in MATHEMATICAL LOGIC QUARTERLY

Reverse mathematics and well-ordering principles

Michael RathjenAndreas Weiermann

Sharp thresholds for hypergraph regressive Ramsey numbers

Lorenzo CarlucciGyesik LeeAndreas Weiermann

A1 Journal Article in JOURNAL OF COMBINATORIAL THEORY SERIES A

Unprovability and phase transitions in Ramsey theory

Michiel De SmetAndreas WeiermannAndrey Bovykin

Unprovability results involving braids

Lorenzo CarlucciPatrick DehornoyAndreas Weiermann

A1 Journal Article in PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY

2010

A miniaturisation of Ramsey's theorem

Michiel De SmetAndreas Weiermann

Analytic combinatorics of the transfinite: a unifying Tauberian perspective

Andreas Weiermann

Phase transitions in proof theory

Lev GordeevAndreas Weiermann

The reverse mathematics of elementary recursive nonstandard analysis: a robust contribution to the foundations of mathematics

Sam SandersChristian ImpensAndreas Weiermann

Unbounded arithmetic

Sam SandersAndreas Weiermann

2009

A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets

Andreas Weiermann

Ackermannian Lower Bounds for Lengths of Bad Sequences of Monomial Ideals over Polynomial Rings in two Variables

Florian Nicolás PelupessyAndreas Weiermann

Classifying the phase transition threshold for Ackermannian functions

Eran OmriAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

Complexity of Godel's T in lambda-formulation

Wilken GunnarAndreas Weiermann

Phase Transitions for Gödel Incompleteness

Andreas Weiermann

A1 Journal Article in Annals of Pure and Applied Logic

Unprovability, phase transitions and the Riemann zeta-function

Andrey BovykinAndreas Weiermann

2008

Classifying the phase transition threshold for unordered regressive Ramsey numbers

Florian Nicolás PelupessyAndreas Weiermann

Phase transitions for weakly increasing sequences

Michiel De SmetAndreas Weiermann

Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers

Menachem KojmanGyesik LeeEran OmriAndreas Weiermann

A1 Journal Article in JOURNAL OF COMBINATORIAL THEORY SERIES A

2007

A sharp phase transition threshold for elementary descent recursive functions

A den BoerAndreas Weiermann

A1 Journal Article in JOURNAL OF LOGIC AND COMPUTATION

More on lower bounds for partitioning α-large sets

Henryk KotlarskiBozena PiekartAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

Phase transition thresholds for some Friedman-style independence results

Andreas Weiermann

A1 Journal Article in MATHEMATICAL LOGIC QUARTERLY

2006

An extremely sharp phase transition threshold for the slow growing hierarchy

Andreas Weiermann

A1 Journal Article in MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE

Classifying the provably total functions of PA

Andreas Weiermann

A1 Journal Article in BULLETIN OF SYMBOLIC LOGIC

Phase transition thresholds for some natural subclasses of the computable functions

Andreas Weiermann

A1 Journal Article in LOGICAL APPROACHES TO COMPUTATIONAL BARRIERS, PROCEEDINGS

2005

Analytic combinatorics for a certain well-ordered class of iterated exponential terms

Andreas Weiermann

Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results

Andreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

2004

A classification of rapidly growing Ramsey functions

Andreas Weiermann

A1 Journal Article in PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY

2003

An application of graphical enumeration to PA

Andreas Weiermann

A1 Journal Article in JOURNAL OF SYMBOLIC LOGIC

An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions

Andreas Weiermann

A1 Journal Article in DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

Relating derivation lengths with the slow-growing hierarchy directly

G MoserAndreas Weiermann

A1 Journal Article in REWRITING TECNIQUES AND APPLICATIONS, PROCEEDINGS

2002

Slow versus fast growing

Andreas Weiermann

A1 Journal Article in SYNTHESE

2001

Gamma(0) may be minimal subrecursively inaccessible

Andreas Weiermann

A1 Journal Article in MATHEMATICAL LOGIC QUARTERLY

Some interesting connections between the slow growing hierarchy and the Ackermann function

Andreas Weiermann

A1 Journal Article in JOURNAL OF SYMBOLIC LOGIC

2000

Analyzing Godel's T via expanded head reduction trees

A BeckmannAndreas Weiermann

A1 Journal Article in MATHEMATICAL LOGIC QUARTERLY

Characterizing the elementary recursive functions by a fragment of Godel's T

A BeckmannAndreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

1998

Bounding derivation lengths with functions from the slow growing hierarchy

Andreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

How is it that infinitary methods can be applied to finitary mathematics? Godel's T : a case study

Andreas Weiermann

A1 Journal Article in JOURNAL OF SYMBOLIC LOGIC

1997

A proof of strongly uniform termination for Godel's T by methods from local predicativity

Andreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

Sometimes slow growing is fast growing

Andreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

Term rewriting theory for the primitive recursive functions

EA CichonAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

1996

A term rewriting characterization of the polytime functions and related complexity classes

A BeckmannAndreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

How to characterize provably total functions by local predicativity

Andreas Weiermann

A1 Journal Article in JOURNAL OF SYMBOLIC LOGIC

1995

Investigations on slow versus fast growing : how to majorize slow growing functions nontrivially by fast growing ones

Andreas Weiermann

A1 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

Andreas Weiermann

A1 Journal Article in THEORETICAL COMPUTER SCIENCE

1994

A functorial property of the Aczel-Buchholz-Feferman function

Andreas Weiermann

A1 Journal Article in JOURNAL OF SYMBOLIC LOGIC

A uniform approach to fundamental sequences and hierarchies

W BuchholzA CichonAndreas Weiermann

A1 Journal Article in MATHEMATICAL LOGIC QUARTERLY

Complexity bounds for some finite forms of Kruskal theorem

Andreas Weiermann

A1 Journal Article in JOURNAL OF SYMBOLIC COMPUTATION

1993

A simplified functorial construction of the Veblen hierarchy

Andreas Weiermann

A1 Journal Article in MATHEMATICAL LOGIC QUARTERLY

An order-theoretic characterization of the Schutte-Veblen-hierarchy

Andreas Weiermann

A1 Journal Article in MATHEMATICAL LOGIC QUARTERLY

Bounds for the closure ordinals of essentially monotonic increasing functions

Andreas Weiermann

A1 Journal Article in JOURNAL OF SYMBOLIC LOGIC

Proof-theoretic investigations on Kruskal theorem

M RathjenAndreas Weiermann

A1 Journal Article in ANNALS OF PURE AND APPLIED LOGIC

1992

Proving termination for term rewriting-systems

Andreas Weiermann

A1 Journal Article in LECTURE NOTES IN COMPUTER SCIENCE

1991

Vereinfachte Kollabierungsfunktionen und ihre Anwendungen

Andreas Weiermann

A2 Journal Article in ARCHIVE FOR MATHEMATICAL LOGIC

1990

Ein neuer Zugang zu Kollabierungsfunktionen

Andreas WeiermannWolfram Pohlers