Andreas Weiermann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Andreas Weiermann has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Michael Rathjen
School of Mathematics, University of Leeds, Leeds, UK
8 shared publications - Juan Pablo Aguilera
Institute of Discrete Mathematics and Geometry Vienna University of Technology Vienna Austria
5 shared publications - David Fernández-Duque
University of Barcelona
4 shared publications - Jeroen Van der Meeren
Ghent University
4 shared publications - Anton Freund
University of Würzburg, Institute of Mathematics, Emil-Fischer-Str. 40, 97074 Würzburg, Germany
3 shared publications - Arnold Beckmann
Swansea University
3 shared publications
Latest Publications
- 13 November 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Ordinal analysis of well-ordering principles, well quasi-orders closure properties, and Σn-collection schema
The study of well quasi-orders ( wqo ) is a relevant part of combinatorics and within wqo theory Kruskal’s theorem plays a crucial role. Extending previous proof-theoretic results, we calculate the [Formula: see text] ordinals of two different versions of labeled Kruskal’s theorem: [Formula: see text] and [Formula: see text] denoting, respectively, all the cases of labeled Kruskal’s theorem for trees with an upper bound on the branching degree, and the standard Kruskal’s theorem for labeled trees. [Formula: see text]In order to reach these computations, a key step is to move from Kruskal’s theorem, which regards preservation of wqo ’s, to an equivalent Well-Ordering Principle (WOP), regarding instead preservation of well-orders. Given an ordinal function [Formula: see text], WOP[Formula: see text] amounts to the following principle [Formula: see text], where WO[Formula: see text] states that “[Formula: see text] is a well-order”. In our case, the two ordinal functions involved are [Formula: see text] and [Formula: see text]. [Formula: see text]In addition to the ordinal analysis of Kruskal’s theorem and its related WOP, a series of Well Quasi-orders Principles (WQP) is considered. Given a set operation [Formula: see text] that preserves the property of being a wqo , its Well Quasi-orders Principle, WQP[Formula: see text], is given by the statement [Formula: see text]. Conducting this study, unexpected connections with different principles arising from Ramsey and Computational theory, such as RT[Formula: see text], CAC, ADS, RT[Formula: see text], turn up. [Formula: see text]Lastly, extending and combining previous results, we also obtain the ordinal analysis of the collection schema [Formula: see text] within a weak base theory.
- 13 November 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Ordinal analysis of well-ordering principles, well quasi-orders closure properties, and Σn-collection schema
The study of well quasi-orders ( wqo ) is a relevant part of combinatorics and within wqo theory Kruskal’s theorem plays a crucial role. Extending previous proof-theoretic results, we calculate the [Formula: see text] ordinals of two different versions of labeled Kruskal’s theorem: [Formula: see text] and [Formula: see text] denoting, respectively, all the cases of labeled Kruskal’s theorem for trees with an upper bound on the branching degree, and the standard Kruskal’s theorem for labeled trees. [Formula: see text]In order to reach these computations, a key step is to move from Kruskal’s theorem, which regards preservation of wqo ’s, to an equivalent Well-Ordering Principle (WOP), regarding instead preservation of well-orders. Given an ordinal function [Formula: see text], WOP[Formula: see text] amounts to the following principle [Formula: see text], where WO[Formula: see text] states that “[Formula: see text] is a well-order”. In our case, the two ordinal functions involved are [Formula: see text] and [Formula: see text]. [Formula: see text]In addition to the ordinal analysis of Kruskal’s theorem and its related WOP, a series of Well Quasi-orders Principles (WQP) is considered. Given a set operation [Formula: see text] that preserves the property of being a wqo , its Well Quasi-orders Principle, WQP[Formula: see text], is given by the statement [Formula: see text]. Conducting this study, unexpected connections with different principles arising from Ramsey and Computational theory, such as RT[Formula: see text], CAC, ADS, RT[Formula: see text], turn up. [Formula: see text]Lastly, extending and combining previous results, we also obtain the ordinal analysis of the collection schema [Formula: see text] within a weak base theory.
- 15 October 2026
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- p. 1-34
PROOF-THEORETIC RELATIONS BETWEEN HIGMAN’S AND KRUSKAL’S THEOREM, AND INDEPENDENCE RESULTS FOR TREE-LIKE STRUCTURES
Higman’s lemma and Kruskal’s theorem are two of the most celebrated results in the theory of well quasi-orders. In his seminal paper G. Higman obtained what is known as Higman’s lemma as a corollary of a more general theorem, dubbed here as Higman’s theorem. While the lemma deals with finite sequences over a well quasi-order, the theorem is about abstract operations of arbitrarily high arity. J. B. Kruskal was fully aware of this broader framework: in his seminal paper, he not only applied Higman’s lemma at crucial points of his proof but also followed Higman’s proof schema. At the conclusion of the article, Kruskal noted that Higman’s theorem is a special case—restricted to trees of finite degree—of his own tree theorem. Although he provided no formal reduction, he included a glossary translating concepts between the tree and algebraic settings. The equivalence between these versions was later clarified by D. Schmidt and M. Pouzet. In this work, we revisit that equivalence to illuminate the proof-theoretical relationships between the two theorems within the base system RCA $_0$ Subscript 0 of reverse mathematics. Moreover, some independence results over first- and second-order theories are treated. In particular, tree-like structures, involving either Ackermannian terms or exponential expressions, are studied unveiling well-foundedness properties that are independent from Peano arithmetic and relevant fragments of second-order arithmetic.- 15 October 2026
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- p. 1-34
PROOF-THEORETIC RELATIONS BETWEEN HIGMAN’S AND KRUSKAL’S THEOREM, AND INDEPENDENCE RESULTS FOR TREE-LIKE STRUCTURES
Higman’s lemma and Kruskal’s theorem are two of the most celebrated results in the theory of well quasi-orders. In his seminal paper G. Higman obtained what is known as Higman’s lemma as a corollary of a more general theorem, dubbed here as Higman’s theorem. While the lemma deals with finite sequences over a well quasi-order, the theorem is about abstract operations of arbitrarily high arity. J. B. Kruskal was fully aware of this broader framework: in his seminal paper, he not only applied Higman’s lemma at crucial points of his proof but also followed Higman’s proof schema. At the conclusion of the article, Kruskal noted that Higman’s theorem is a special case—restricted to trees of finite degree—of his own tree theorem. Although he provided no formal reduction, he included a glossary translating concepts between the tree and algebraic settings. The equivalence between these versions was later clarified by D. Schmidt and M. Pouzet. In this work, we revisit that equivalence to illuminate the proof-theoretical relationships between the two theorems within the base system RCA $_0$ Subscript 0 of reverse mathematics. Moreover, some independence results over first- and second-order theories are treated. In particular, tree-like structures, involving either Ackermannian terms or exponential expressions, are studied unveiling well-foundedness properties that are independent from Peano arithmetic and relevant fragments of second-order arithmetic.- 19 September 2025
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
Maximum linearizations of lower sets in ℕ^{𝕞} with application to monomial ideals
We compute the type (maximum linearization) of the well partial order of bounded lower sets in N m \mathbb {N}^m , ordered under inclusion, and find it is ω ω m − 1 \omega ^{\omega ^{m-1}} . Moreover we compute the type of the set of all lower sets in N m \mathbb {N}^m , a topic studied by Aschenbrenner and Pong [Fund. Math. 181 (2004), pp. 27–74], and find that it is equal to \[ ω ∑ k = 1 m ω m − k ( m k − 1 ) + 1. \omega ^{\sum _{k=1}^{m} \omega ^{m-k}\binom {m}{k-1} }+ 1. \] As a consequence we deduce corresponding lower bounds on effectively given sequences of lower sets and effectively given sequences of monomial ideals in F [ X , Y ] F[X,Y] where F F is a field.
- 19 September 2025
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
Maximum linearizations of lower sets in ℕ^{𝕞} with application to monomial ideals
We compute the type (maximum linearization) of the well partial order of bounded lower sets in N m \mathbb {N}^m , ordered under inclusion, and find it is ω ω m − 1 \omega ^{\omega ^{m-1}} . Moreover we compute the type of the set of all lower sets in N m \mathbb {N}^m , a topic studied by Aschenbrenner and Pong [Fund. Math. 181 (2004), pp. 27–74], and find that it is equal to \[ ω ∑ k = 1 m ω m − k ( m k − 1 ) + 1. \omega ^{\sum _{k=1}^{m} \omega ^{m-k}\binom {m}{k-1} }+ 1. \] As a consequence we deduce corresponding lower bounds on effectively given sequences of lower sets and effectively given sequences of monomial ideals in F [ X , Y ] F[X,Y] where F F is a field.
- Open Access
Induction on Dilators and Bachmann-Howard Fixed Points
One of the most important principles of J.-Y. Girard's $Π^1_2$-logic is induction on dilators. In particular, Girard used this principle to construct his famous functor $Λ$. He claimed that the totality of $Λ$ is equivalent to the set existence axiom of $Π^1_1$-comprehension from reverse mathematics. While Girard provided a plausible description of a proof around 1980, it seems that the very technical details have not been worked out to this day. A few years ago, a loosely related approach led to an equivalence between $Π^1_1$-comprehension and a certain Bachmann-Howard principle. The present paper closes the circle. We relate the Bachmann-Howard principle to induction on dilators. This allows us to show that $Π^1_1$-comprehension is equivalent to the totality of a functor $\mathbb J$ due to P. Päppinghaus, which can be seen as a streamlined version of $Λ$.Open AccessInduction on Dilators and Bachmann-Howard Fixed Points
One of the most important principles of J.-Y. Girard's $Π^1_2$-logic is induction on dilators. In particular, Girard used this principle to construct his famous functor $Λ$. He claimed that the totality of $Λ$ is equivalent to the set existence axiom of $Π^1_1$-comprehension from reverse mathematics. While Girard provided a plausible description of a proof around 1980, it seems that the very technical details have not been worked out to this day. A few years ago, a loosely related approach led to an equivalence between $Π^1_1$-comprehension and a certain Bachmann-Howard principle. The present paper closes the circle. We relate the Bachmann-Howard principle to induction on dilators. This allows us to show that $Π^1_1$-comprehension is equivalent to the totality of a functor $\mathbb J$ due to P. Päppinghaus, which can be seen as a streamlined version of $Λ$. - 26 July 2024
- Published by Springer Nature
- p. 273-301
Well Partial Orders
- Open Access
- 26 January 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e15
Functorial Fast-Growing Hierarchies
We prove an isomorphism theorem between the canonical denotation systems for large natural numbers and large countable ordinal numbers, linking two fundamental concepts in Proof Theory. The first one is fast-growing hierarchies. These are sequences of functions on $\mathbb {N}$ obtained through processes such as the ones that yield multiplication from addition, exponentiation from multiplication, etc. and represent the canonical way of speaking about large finite numbers. The second one is ordinal collapsing functions, which represent the best-known method of describing large computable ordinals. We observe that fast-growing hierarchies can be naturally extended to functors on the categories of natural numbers and of linear orders. The isomorphism theorem asserts that the categorical extensions of binary fast-growing hierarchies to ordinals are isomorphic to denotation systems given by cardinal collapsing functions. As an application of this fact, we obtain a restatement of the subsystem $\Pi ^1_1$ - ${\mathsf {CA_0}}$ of analysis as a higher-type well-ordering principle asserting that binary fast-growing hierarchies preserve well-foundedness.- 26 January 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e15
Open AccessFunctorial Fast-Growing Hierarchies
We prove an isomorphism theorem between the canonical denotation systems for large natural numbers and large countable ordinal numbers, linking two fundamental concepts in Proof Theory. The first one is fast-growing hierarchies. These are sequences of functions on $\mathbb {N}$ obtained through processes such as the ones that yield multiplication from addition, exponentiation from multiplication, etc. and represent the canonical way of speaking about large finite numbers. The second one is ordinal collapsing functions, which represent the best-known method of describing large computable ordinals. We observe that fast-growing hierarchies can be naturally extended to functors on the categories of natural numbers and of linear orders. The isomorphism theorem asserts that the categorical extensions of binary fast-growing hierarchies to ordinals are isomorphic to denotation systems given by cardinal collapsing functions. As an application of this fact, we obtain a restatement of the subsystem $\Pi ^1_1$ - ${\mathsf {CA_0}}$ of analysis as a higher-type well-ordering principle asserting that binary fast-growing hierarchies preserve well-foundedness. - Open Access
- 17 January 2024
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 30 (1) , 1-19
A WALK WITH GOODSTEIN
Goodstein’s principle is arguably the first purely number-theoretic statement known to be independent of Peano arithmetic. It involves sequences of natural numbers which at first appear to diverge, but eventually decrease to zero. These sequences are defined relative to a notation system based on exponentiation for the natural numbers. In this article, we provide a self-contained and modern analysis of Goodstein’s principle, obtaining some variations and improvements. We explore notions of optimality for notation systems and apply them to the classical Goodstein process and to a weaker variant based on multiplication rather than exponentiation. In particular, we introduce the notion of base-change maximality, and show how it leads to far-reaching extensions of Goodstein’s result. We moreover show that by varying the initial base of the Goodstein process, one readily obtains independence results for each of the fragments $\mathsf {I}\Sigma _n$ of Peano arithmetic.- 17 January 2024
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 30 (1) , 1-19
Open AccessA WALK WITH GOODSTEIN
Goodstein’s principle is arguably the first purely number-theoretic statement known to be independent of Peano arithmetic. It involves sequences of natural numbers which at first appear to diverge, but eventually decrease to zero. These sequences are defined relative to a notation system based on exponentiation for the natural numbers. In this article, we provide a self-contained and modern analysis of Goodstein’s principle, obtaining some variations and improvements. We explore notions of optimality for notation systems and apply them to the classical Goodstein process and to a weaker variant based on multiplication rather than exponentiation. In particular, we introduce the notion of base-change maximality, and show how it leads to far-reaching extensions of Goodstein’s result. We moreover show that by varying the initial base of the Goodstein process, one readily obtains independence results for each of the fragments $\mathsf {I}\Sigma _n$ of Peano arithmetic. - 10 April 2023
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 381 (2248) , 20220017
Some independence results related to finite trees
We investigate some concrete independence results for systems of reverse mathematics which emerge from monotonicity properties of number-theoretic functions. Natural properties of the less than or equal to relation with respect to sums of natural numbers lead to independence results for first-order Peano arithmetic. Natural properties of the less than or equal to relation with respect to sums and products of natural numbers lead to independence results for arithmetical transfinite recursion. By considering number-theoretic functions of arbitrary arities, we obtain independence results for systems beyond arithmetical transfinite recursion. We discuss how these embeddability relations are related to tree embeddability relations and we consider variants where the tree embeddability relation is not assumed to preserve infima. The findings of this paper are complementary to results on Kruskal-like theorems proved earlier by the first author. This article is part of the theme issue ‘Modern perspectives in Proof Theory’.
- 10 April 2023
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 381 (2248) , 20220017
Some independence results related to finite trees
We investigate some concrete independence results for systems of reverse mathematics which emerge from monotonicity properties of number-theoretic functions. Natural properties of the less than or equal to relation with respect to sums of natural numbers lead to independence results for first-order Peano arithmetic. Natural properties of the less than or equal to relation with respect to sums and products of natural numbers lead to independence results for arithmetical transfinite recursion. By considering number-theoretic functions of arbitrary arities, we obtain independence results for systems beyond arithmetical transfinite recursion. We discuss how these embeddability relations are related to tree embeddability relations and we consider variants where the tree embeddability relation is not assumed to preserve infima. The findings of this paper are complementary to results on Kruskal-like theorems proved earlier by the first author. This article is part of the theme issue ‘Modern perspectives in Proof Theory’.
- Open Access
- 10 April 2023
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 381 (2248) , 20220020
Modern perspectives in Proof Theory
- 10 April 2023
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 381 (2248) , 20220020
Open AccessModern perspectives in Proof Theory
- Open Access
Arithmetical and Hyperarithmetical Worm Battles
Japaridze's provability logic $GLP$ has one modality $[n]$ for each natural number and has been used by Beklemishev for a proof theoretic analysis of Peano aritmetic $(PA)$ and related theories. Among other benefits, this analysis yields the so-called Every Worm Dies $(EWD)$ principle, a natural combinatorial statement independent of $PA$. Recently, Beklemishev and Pakhomov have studied notions of provability corresponding to transfinite modalities in $GLP$. We show that indeed the natural transfinite extension of $GLP$ is sound for this interpretation, and yields independent combinatorial principles for the second order theory $ACA$ of arithmetical comprehension with full induction. We also provide restricted versions of $EWD$ related to the fragments $I\Sigma_n$ of Peano arithmetic. In order to prove the latter, we show that standard Hardy functions majorize their variants based on tree ordinals.Open AccessArithmetical and Hyperarithmetical Worm Battles
Japaridze's provability logic $GLP$ has one modality $[n]$ for each natural number and has been used by Beklemishev for a proof theoretic analysis of Peano aritmetic $(PA)$ and related theories. Among other benefits, this analysis yields the so-called Every Worm Dies $(EWD)$ principle, a natural combinatorial statement independent of $PA$. Recently, Beklemishev and Pakhomov have studied notions of provability corresponding to transfinite modalities in $GLP$. We show that indeed the natural transfinite extension of $GLP$ is sound for this interpretation, and yields independent combinatorial principles for the second order theory $ACA$ of arithmetical comprehension with full induction. We also provide restricted versions of $EWD$ related to the fragments $I\Sigma_n$ of Peano arithmetic. In order to prove the latter, we show that standard Hardy functions majorize their variants based on tree ordinals.