| Publication | Date of Publication | Type |
|---|
Correction to: ``Arithmetical and hyperarithmetical worm battles
Journal Of Logic And Computation | 2024-11-12 | Paper |
Well partial orders
| 2024-10-01 | Paper |
A walk with Goodstein and Ackermann
Notre Dame Journal of Formal Logic | 2024-08-19 | Paper |
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
Annals of Pure and Applied Logic | 2024-06-24 | Paper |
A WALK WITH GOODSTEIN
The Bulletin of Symbolic Logic | 2024-04-09 | Paper |
Functorial Fast-Growing Hierarchies
Forum of Mathematics, Sigma | 2024-02-07 | Paper |
Intermediate Goodstein Principles
Mathematics for Computation (M4C) | 2023-08-04 | Paper |
Ackermannian Goodstein sequences of intermediate growth
| 2022-12-16 | Paper |
Boundedness theorems for flowers and sharps
Proceedings of the American Mathematical Society | 2022-07-08 | Paper |
Minimal bad sequences are necessary for a uniform Kruskal theorem
Advances in Mathematics | 2022-04-14 | Paper |
Calculating maximal order types for finite rooted unstructured labeled trees
The Legacy of Kurt Schütte | 2021-12-03 | Paper |
Fast Goodstein Walks
| 2021-11-30 | Paper |
Ackermann and Goodstein go functorial
Pacific Journal of Mathematics | 2021-10-19 | Paper |
GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION
The Bulletin of Symbolic Logic | 2021-09-17 | Paper |
Ackermannian Goodstein principles for first order Peano arithmetic
Sets and Computations | 2020-12-02 | Paper |
Ackermann and Goodstein go functorial
| 2020-11-06 | Paper |
Monadic second order limit laws for natural well orderings
| 2020-07-28 | Paper |
Giant and illusionary giant Goodstein principles
| 2020-07-17 | Paper |
Predicatively unprovable termination of the Ackermannian Goodstein process
Proceedings of the American Mathematical Society | 2020-06-11 | Paper |
Minimal bad sequences are necessary for a uniform Kruskal theorem
| 2020-01-17 | Paper |
Classifying phase transition thresholds for Goodstein sequences and hydra games
Gentzen's Centenary | 2017-09-27 | Paper |
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
Archive for Mathematical Logic | 2017-09-15 | Paper |
The strength of infinitary Ramseyan principles can be accessed by their densities
Annals of Pure and Applied Logic | 2017-06-15 | Paper |
An order-theoretic characterization of the Howard-Bachmann-hierarchy
Archive for Mathematical Logic | 2017-02-24 | Paper |
Phase transitions in proof theory
| 2017-02-10 | Paper |
scientific article; zbMATH DE number 6536267 (Why is no real title available?)
| 2016-01-27 | Paper |
Provable or not? The limit 0,639578175\(\ldots\)
Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) | 2015-12-10 | Paper |
How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems
Evolving Computability | 2015-10-20 | Paper |
Goodstein sequences for prominent ordinals up to the ordinal of \(\Pi^1_1\)-\(\mathrm{CA}_0\)
Annals of Pure and Applied Logic | 2015-08-27 | Paper |
Phase transitions related to the pigeonhole principle
Language, Life, Limits | 2015-02-25 | Paper |
Well-partial-orderings and the big Veblen number
Archive for Mathematical Logic | 2015-02-23 | Paper |
scientific article; zbMATH DE number 6307926 (Why is no real title available?)
| 2014-06-24 | Paper |
Asymptotic distribution of integers with certain prime factorizations
Journal of Number Theory | 2014-02-07 | Paper |
Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
Proceedings of the American Mathematical Society | 2013-09-02 | Paper |
Slow consistency
Annals of Pure and Applied Logic | 2013-02-19 | Paper |
Reverse mathematics and well-ordering principles
| 2012-09-05 | Paper |
\(\mathcal M^2\)-computable real numbers
Journal of Logic and Computation | 2012-09-05 | Paper |
Some natural zero one laws for ordinals below \(\epsilon _{0}\)
Lecture Notes in Computer Science | 2012-08-14 | Paper |
A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions
| 2012-05-13 | Paper |
Sharp thresholds for a phase transition related to weakly increasing sequences
Journal of Logic and Computation | 2012-05-07 | Paper |
Derivation lengths classification of Gödel's T extending Howard's assignment
Logical Methods in Computer Science | 2012-04-03 | Paper |
Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal
Annals of Pure and Applied Logic | 2012-03-29 | Paper |
Streamlined subrecursive degree theory
Annals of Pure and Applied Logic | 2012-03-29 | Paper |
Phase transitions of iterated Higman-style well-partial-orderings
Archive for Mathematical Logic | 2012-02-10 | Paper |
On the lengths of bad sequences of monomial ideals over polynomial rings
Fundamenta Mathematicae | 2012-01-13 | Paper |
Ordinal arithmetic with simultaneously defined theta-functions
Mathematical Logic Quarterly | 2011-05-06 | Paper |
scientific article; zbMATH DE number 5859852 (Why is no real title available?)
| 2011-03-02 | Paper |
Unprovability results involving braids
Proceedings of the London Mathematical Society | 2011-01-19 | Paper |
Sharp thresholds for hypergraph regressive Ramsey numbers
Journal of Combinatorial Theory. Series A | 2011-01-14 | Paper |
Unprovability, phase transitions and the Riemann zeta-function
| 2010-09-02 | Paper |
A miniaturisation of Ramsey's theorem
Programs, Proofs, Processes | 2010-07-29 | Paper |
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Partitioning $\alpha$-large sets for $\alpha<\varepsilon_{\omega}$
| 2010-01-14 | Paper |
Complexity of Gödel’s T in λ-Formulation
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Classifying the phase transition threshold for Ackermannian functions
Annals of Pure and Applied Logic | 2009-04-16 | Paper |
Phase transitions for Gödel incompleteness
Annals of Pure and Applied Logic | 2009-03-25 | Paper |
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
Journal of Combinatorial Theory. Series A | 2008-09-04 | Paper |
Phase Transitions for Weakly Increasing Sequences
Logic and Theory of Algorithms | 2008-06-19 | Paper |
A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions
Journal Of Logic And Computation | 2008-02-07 | Paper |
More on lower bounds for partitioning \(\alpha\)-large sets
Annals of Pure and Applied Logic | 2007-07-16 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Classifying the Provably Total Functions of PA
The Bulletin of Symbolic Logic | 2007-04-05 | Paper |
Phase transition thresholds for some Friedman-style independence results
MLQ | 2007-02-20 | Paper |
An extremely sharp phase transition threshold for the slow growing hierarchy
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
Analytic combinatorics for a certain well-ordered class of iterated exponential terms
| 2006-08-29 | Paper |
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
Annals of Pure and Applied Logic | 2005-09-22 | Paper |
scientific article; zbMATH DE number 2152691 (Why is no real title available?)
| 2005-04-05 | Paper |
An application of graphical enumeration to PA *
Journal of Symbolic Logic | 2004-03-25 | Paper |
scientific article; zbMATH DE number 2043536 (Why is no real title available?)
| 2004-02-16 | Paper |
scientific article; zbMATH DE number 2038888 (Why is no real title available?)
| 2004-02-08 | Paper |
A classification of rapidly growing Ramsey functions
Proceedings of the American Mathematical Society | 2003-10-29 | Paper |
scientific article; zbMATH DE number 1984565 (Why is no real title available?)
| 2003-09-22 | Paper |
Slow versus fast growing
Synthese | 2003-04-27 | Paper |
Some interesting connections between the slow growing hierarchy and the Ackermann function
The Journal of Symbolic Logic | 2002-09-16 | Paper |
\(\Gamma_0\) may be minimal subrecursively inaccessible
Mathematical Logic Quarterly (MLQ) | 2001-11-06 | Paper |
Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)
Archive for Mathematical Logic | 2001-07-26 | Paper |
Analyzing Gödel's T Via Expanded Head Reduction Trees
| 2001-07-16 | Paper |
scientific article; zbMATH DE number 1390283 (Why is no real title available?)
| 2000-09-27 | Paper |
A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems
Studia Logica | 1999-11-22 | Paper |
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
Journal of Symbolic Logic | 1999-09-09 | Paper |
Bounding derivation lengths with functions from the slow growing hierarchy
Archive for Mathematical Logic | 1999-08-19 | Paper |
Sometimes slow growing is fast growing
Annals of Pure and Applied Logic | 1998-08-03 | Paper |
A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity
Archive for Mathematical Logic | 1997-12-10 | Paper |
Term rewriting theory for the primitive recursive functions
Annals of Pure and Applied Logic | 1997-09-29 | Paper |
A term rewriting characterization of the polytime functions and related complexity classes
Archive for Mathematical Logic | 1997-06-02 | Paper |
How to characterize provably total functions by local predicativity
Journal of Symbolic Logic | 1997-04-10 | Paper |
Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
Theoretical Computer Science | 1997-02-28 | Paper |
scientific article; zbMATH DE number 922625 (Why is no real title available?)
| 1997-01-13 | Paper |
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
Archive for Mathematical Logic | 1996-07-24 | Paper |
A simplified functorial construction of the veblen hierarchy
Mathematical Logic Quarterly | 1995-06-13 | Paper |
Complexity bounds for some finite forms of Kruskal's theorem
Journal of Symbolic Computation | 1995-06-08 | Paper |
A Uniform Approach to Fundamental Sequences and Hierarchies
Mathematical Logic Quarterly | 1995-05-14 | Paper |
A functorial property of the Aczel-Buchholz-Feferman function
Journal of Symbolic Logic | 1995-03-15 | Paper |
An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy
Mathematical Logic Quarterly | 1994-10-05 | Paper |
Simplified collapsing functions and their applications
Archive for Mathematical Logic | 1993-10-26 | Paper |
Bounds for the closure ordinals of essentially monotonic increasing functions
Journal of Symbolic Logic | 1993-10-24 | Paper |
scientific article; zbMATH DE number 408817 (Why is no real title available?)
| 1993-09-06 | Paper |
Proof-theoretic investigations on Kruskal's theorem
Annals of Pure and Applied Logic | 1993-05-16 | Paper |
scientific article; zbMATH DE number 51613 (Why is no real title available?)
| 1992-09-18 | Paper |
scientific article; zbMATH DE number 4150146 (Why is no real title available?)
| 1991-01-01 | Paper |
Maximum linearizations of lower sets in $\mathbb{N}^m$ with application to monomial ideals
| N/A | Paper |
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
| N/A | Paper |
