Andreas Weiermann

From MaRDI portal
Person:408159

Available identifiers

zbMath Open weiermann.andreasMaRDI QIDQ408159

List of research outcomes





PublicationDate of PublicationType
Correction to: ``Arithmetical and hyperarithmetical worm battles2024-11-12Paper
Well partial orders2024-10-01Paper
A walk with Goodstein and Ackermann2024-08-19Paper
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal2024-06-24Paper
A WALK WITH GOODSTEIN2024-04-09Paper
Functorial Fast-Growing Hierarchies2024-02-07Paper
Intermediate Goodstein Principles2023-08-04Paper
Ackermannian Goodstein sequences of intermediate growth2022-12-16Paper
Boundedness theorems for flowers and sharps2022-07-08Paper
Minimal bad sequences are necessary for a uniform Kruskal theorem2022-04-14Paper
Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees2021-12-03Paper
Fast Goodstein Walks2021-11-30Paper
Ackermann and Goodstein go functorial2021-10-19Paper
GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION2021-09-17Paper
ACKERMANNIAN GOODSTEIN PRINCIPLES FOR FIRST ORDER PEANO ARITHMETIC2020-12-02Paper
Ackermann and Goodstein go functorial2020-11-06Paper
Monadic second order limit laws for natural well orderings2020-07-28Paper
Giant and illusionary giant Goodstein principles2020-07-17Paper
Predicatively unprovable termination of the Ackermannian Goodstein process2020-06-11Paper
Minimal bad sequences are necessary for a uniform Kruskal theorem2020-01-17Paper
Classifying Phase Transition Thresholds for Goodstein Sequences and Hydra Games2017-09-27Paper
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition2017-09-15Paper
The strength of infinitary Ramseyan principles can be accessed by their densities2017-06-15Paper
An order-theoretic characterization of the Howard-Bachmann-hierarchy2017-02-24Paper
https://portal.mardi4nfdi.de/entity/Q29599162017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q34646162016-01-27Paper
Provable or not? The limit 0,639578175\(\ldots\)2015-12-10Paper
How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems2015-10-20Paper
Goodstein sequences for prominent ordinals up to the ordinal of \(\Pi^1_1\)-\(\mathrm{CA}_0\)2015-08-27Paper
Phase Transitions Related to the Pigeonhole Principle2015-02-25Paper
Well-partial-orderings and the big Veblen number2015-02-23Paper
https://portal.mardi4nfdi.de/entity/Q49814412014-06-24Paper
Asymptotic distribution of integers with certain prime factorizations2014-02-07Paper
Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension2013-09-02Paper
Slow consistency2013-02-19Paper
Reverse mathematics and well-ordering principles2012-09-05Paper
\(\mathcal M^2\)-computable real numbers2012-09-05Paper
Some Natural Zero One Laws for Ordinals Below ε 02012-08-14Paper
A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions2012-05-13Paper
Sharp thresholds for a phase transition related to weakly increasing sequences2012-05-07Paper
Derivation lengths classification of Gödel's T extending Howard's assignment2012-04-03Paper
Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal2012-03-29Paper
Streamlined subrecursive degree theory2012-03-29Paper
Phase transitions of iterated Higman-style well-partial-orderings2012-02-10Paper
On the lengths of bad sequences of monomial ideals over polynomial rings2012-01-13Paper
Ordinal arithmetic with simultaneously defined theta-functions2011-05-06Paper
https://portal.mardi4nfdi.de/entity/Q30796992011-03-02Paper
Unprovability results involving braids2011-01-19Paper
Sharp thresholds for hypergraph regressive Ramsey numbers2011-01-14Paper
https://portal.mardi4nfdi.de/entity/Q35820512010-09-02Paper
A Miniaturisation of Ramsey’s Theorem2010-07-29Paper
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets2010-07-28Paper
Partitioning $\alpha$-large sets for $\alpha<\varepsilon_{\omega}$2010-01-14Paper
Complexity of Gödel’s T in λ-Formulation2009-07-07Paper
Classifying the phase transition threshold for Ackermannian functions2009-04-16Paper
Phase transitions for Gödel incompleteness2009-03-25Paper
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers2008-09-04Paper
Phase Transitions for Weakly Increasing Sequences2008-06-19Paper
A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions2008-02-07Paper
More on lower bounds for partitioning \(\alpha\)-large sets2007-07-16Paper
Logical Approaches to Computational Barriers2007-04-30Paper
Classifying the Provably Total Functions of PA2007-04-05Paper
Phase transition thresholds for some Friedman-style independence results2007-02-20Paper
An extremely sharp phase transition threshold for the slow growing hierarchy2007-02-09Paper
https://portal.mardi4nfdi.de/entity/Q54853052006-08-29Paper
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q46642592005-04-05Paper
An application of graphical enumeration to PA *2004-03-25Paper
https://portal.mardi4nfdi.de/entity/Q44472402004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44492912004-02-08Paper
A classification of rapidly growing Ramsey functions2003-10-29Paper
https://portal.mardi4nfdi.de/entity/Q44289312003-09-22Paper
Slow versus fast growing2003-04-27Paper
Some interesting connections between the slow growing hierarchy and the Ackermann function2002-09-16Paper
\(\Gamma_0\) may be minimal subrecursively inaccessible2001-11-06Paper
Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)2001-07-26Paper
Analyzing Gödel's T Via Expanded Head Reduction Trees2001-07-16Paper
https://portal.mardi4nfdi.de/entity/Q49345702000-09-27Paper
A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems1999-11-22Paper
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study1999-09-09Paper
Bounding derivation lengths with functions from the slow growing hierarchy1999-08-19Paper
Sometimes slow growing is fast growing1998-08-03Paper
A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity1997-12-10Paper
Term rewriting theory for the primitive recursive functions1997-09-29Paper
A term rewriting characterization of the polytime functions and related complexity classes1997-06-02Paper
How to characterize provably total functions by local predicativity1997-04-10Paper
Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q48931451997-01-13Paper
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones1996-07-24Paper
A simplified functorial construction of the veblen hierarchy1995-06-13Paper
Complexity bounds for some finite forms of Kruskal's theorem1995-06-08Paper
A Uniform Approach to Fundamental Sequences and Hierarchies1995-05-14Paper
A functorial property of the Aczel-Buchholz-Feferman function1995-03-15Paper
An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy1994-10-05Paper
Simplified collapsing functions and their applications1993-10-26Paper
Bounds for the closure ordinals of essentially monotonic increasing functions1993-10-24Paper
https://portal.mardi4nfdi.de/entity/Q42029621993-09-06Paper
Proof-theoretic investigations on Kruskal's theorem1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40019931992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q34800351991-01-01Paper
Maximum linearizations of lower sets in $\mathbb{N}^m$ with application to monomial idealsN/APaper
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinalN/APaper

Research outcomes over time

This page was built for person: Andreas Weiermann