Andreas Weiermann

Bull. Symb. Log., 2024

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

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2024

2023

Optimal Image Transport on Sparse Dictionaries.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Arithmetical and Hyperarithmetical Worm Battles.

[BibT_eX]

[DOI]

Konstantinos Papafilippou

Joost J. Joosten

Fedor Pakhomov

J. Log. Comput., 2022

2021

Goodstein sequences based on a Parametrized Ackermann-Péter function.

[BibT_eX]

[DOI]

Toshiyasu Arai

Stanley S. Wainer

Bull. Symb. Log., 2021

2020

Minimal bad sequences are necessary for a uniform Kruskal theorem.

[BibT_eX]

[DOI]

Anton Freund

CoRR, 2020

Ackermannian Goodstein Sequences of Intermediate Growth.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Horizon of Computability, 2020

2017

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

[BibT_eX]

[DOI]

Andrey Bovykin

Ann. Pure Appl. Log., 2017

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

[BibT_eX]

[DOI]

Arch. Math. Log., 2017

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

[BibT_eX]

[DOI]

Arch. Math. Log., 2017

2016

Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).

[BibT_eX]

[DOI]

Jean Goubault-Larrecq

Monika Seisenberger

Victor L. Selivanov

Dagstuhl Reports, 2016

2015

Well-partial-orderings and the big Veblen number.

[BibT_eX]

[DOI]

Arch. Math. Log., 2015

How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Phase Transitions Related to the Pigeonhole Principle.

[BibT_eX]

[DOI]

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2013

Slow consistency.

[BibT_eX]

[DOI]

Sy-David Friedman

Ann. Pure Appl. Log., 2013

2012

Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences.

[BibT_eX]

[DOI]

J. Log. Comput., 2012

M2-computable real numbers.

[BibT_eX]

[DOI]

Dimiter Skordev

Ivan Georgiev

J. Log. Comput., 2012

Derivation Lengths Classification of Gödel's T Extending Howard's Assignment

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

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

[BibT_eX]

[DOI]

Jan-Christoph Schlage-Puchta

Ann. Pure Appl. Log., 2012

Streamlined subrecursive degree theory.

[BibT_eX]

[DOI]

Lars Kristiansen

Ann. Pure Appl. Log., 2012

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

[BibT_eX]

[DOI]

Lew Gordeev

Arch. Math. Log., 2012

Some Natural Zero One Laws for Ordinals Below ε 0.

[BibT_eX]

[DOI]

Alan R. Woods

Proceedings of the How the World Computes, 2012

2011

Ordinal arithmetic with simultaneously defined theta-functions.

[BibT_eX]

[DOI]

Math. Log. Q., 2011

Sharp thresholds for hypergraph regressive Ramsey numbers.

[BibT_eX]

[DOI]

Lorenzo Carlucci

Gyesik Lee

J. Comb. Theory A, 2011

2010

A Miniaturisation of Ramsey's Theorem.

[BibT_eX]

[DOI]

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Phase transitions for Gödel incompleteness.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

Classifying the phase transition threshold for Ackermannian functions.

[BibT_eX]

[DOI]

Eran Omri

Ann. Pure Appl. Log., 2009

Complexity of Gödel's T in lambda-Formulation.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

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

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

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

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

Phase Transitions for Weakly Increasing Sequences.

[BibT_eX]

[DOI]

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Phase transition thresholds for some Friedman-style independence results.

[BibT_eX]

[DOI]

Math. Log. Q., 2007

A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions.

[BibT_eX]

[DOI]

Arnoud V. den Boer

J. Log. Comput., 2007

More on lower bounds for partitioning alpha-large sets.

[BibT_eX]

[DOI]

Henryk Kotlarski

Bozena Piekart

Ann. Pure Appl. Log., 2007

2006

An extremely sharp phase transition threshold for the slow growing hierarchy.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

Classifying the Provably Total Functions of PA.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2006

Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

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

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

2003

An application of graphical enumeration to PA*.

[BibT_eX]

[DOI]

J. Symb. Log., 2003

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

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2003

Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.

[BibT_eX]

[DOI]

Georg Moser

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002

Slow Versus Fast Growing.

[BibT_eX]

[DOI]

Synth., 2002

2001

Gamma0 May Be Minimal Subrecursively Inaccessible.

[BibT_eX]

[DOI]

Math. Log. Q., 2001

Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function.

[BibT_eX]

[DOI]

J. Symb. Log., 2001

2000

Analyzing Gödel's T Via Expanded Head Reduction Trees.

[BibT_eX]

[DOI]

Arnold Beckmann

Math. Log. Q., 2000

Characterizing the elementary recursive functions by a fragment of Gödel's T.

[BibT_eX]

[DOI]

Arnold Beckmann

Arch. Math. Log., 2000

1999

A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems.

[BibT_eX]

[DOI]

Benjamin Blankertz

Stud Logica, 1999

1998

How Is It that Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study.

[BibT_eX]

[DOI]

J. Symb. Log., 1998

Bounding derivation lengths with functions from the slow growing hierarchy.

[BibT_eX]

[DOI]

Arch. Math. Log., 1998

1997

Sometimes Slow Growing is Fast Growing.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

Term Rewriting Theory for the Primitive Recursive Functions.

[BibT_eX]

[DOI]

E. A. Cichon

Ann. Pure Appl. Log., 1997

A proof of strongly uniform termination for Gödel's TT by methods from local predicativity.

[BibT_eX]

[DOI]

Arch. Math. Log., 1997

1996

How to Characterize Provably Total Functions by Local Predicativity.

[BibT_eX]

[DOI]

J. Symb. Log., 1996

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

[BibT_eX]

[DOI]

Arnold Beckmann

Arch. Math. Log., 1996

1995

Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

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

[BibT_eX]

[DOI]

Arch. Math. Log., 1995

1994

A Uniform Approach to Fundamental Sequences and Hierarchies.

[BibT_eX]

[DOI]

Adam Cichon

Wilfried Buchholz

Math. Log. Q., 1994

A Functorial Property of the Aczel-Buchholz-Feferman Function.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

Complexity Bounds for Some Finite Forms of Kruskal's Theorem.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

1993

An Order-Theoretic Characterization of the Schütte-Veblen-Hierarchy.

[BibT_eX]

[DOI]

Math. Log. Q., 1993

A Simplified Functorial Construction of the Veblen Hierarchy.

[BibT_eX]

[DOI]

Math. Log. Q., 1993

Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions.

[BibT_eX]

[DOI]

J. Symb. Log., 1993

Proof-Theoretic Investigations on Kruskal's Theorem.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1993

1991

Vereinfachte Kollabierungsfunktionen und ihre Anwendungen.

[BibT_eX]

[DOI]

Arch. Math. Log., 1991

Proving Termination for Term Rewriting Systems.

[BibT_eX]

[DOI]