Andreas Weiermann

发表

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

Arnold Beckmann, Andreas Weiermann, 1996, Arch. Math. Log..

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

Andreas Weiermann, Gunnar Wilken, 2009, TLCA.

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

Andreas Weiermann, A. Weiermann, 1997, Arch. Math. Log..

Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences

Michiel De Smet, Andreas Weiermann, 2012, J. Log. Comput..

Classifying the phase transition threshold for Ackermannian functions

Eran Omri, Andreas Weiermann, 2009, Ann. Pure Appl. Log..

Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions

Andreas Weiermann, 1993, J. Symb. Log..

Vereinfachte Kollabierungsfunktionen und ihre Anwendungen

Andreas Weiermann, 1991, Arch. Math. Log..

A very slow growing hierarchy for

Jan van Eijck, Vincent van Oostrom, Albert Visser, 2016 .

A Miniaturisation of Ramsey's Theorem

Michiel De Smet, Andreas Weiermann, A. Weiermann, 2010, CiE.

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

Andreas Weiermann, A. Weiermann, 2009, CiE.

Streamlined subrecursive degree theory

Andreas Weiermann, Lars Kristiansen, Jan-Christoph Schlage-Puchta, 2012, Ann. Pure Appl. Log..

A Functorial Property of the Aczel-Buchholz-Feferman Function

Andreas Weiermann, 1994, J. Symb. Log..

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

Benjamin Blankertz, Andreas Weiermann, 1999, Stud Logica.

An application of graphical enumeration to PA*

Andreas Weiermann, A. Weiermann, 2003, Journal of Symbolic Logic.

M2-computable real numbers

Ivan Georgiev, Andreas Weiermann, Dimiter Skordev, 2012, J. Log. Comput..

A Uniform Approach to Fundamental Sequences and Hierarchies

Andreas Weiermann, Wilfried Buchholz, Adam Cichon, 1994, Math. Log. Q..

Term Rewriting Theory for the Primitive Recursive Functions

Andreas Weiermann, E. A. Cichon, 1997, Ann. Pure Appl. Log..

Minimal bad sequences are necessary for a uniform Kruskal theorem pdf

Anton Freund, Andreas Weiermann, Michael Rathjen, 2020, Advances in Mathematics.

Slow Versus Fast Growing

Andreas Weiermann, A. Weiermann, 2002, Synthese.

Phase Transitions for Weakly Increasing Sequences

Michiel De Smet, Andreas Weiermann, 2008, CiE.

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

Michiel De Smet, Andreas Weiermann, 2012, Ann. Pure Appl. Log..

Phase transitions for weakly increasing sequences

Michiel De Smet, Andreas Weiermann, 2008 .

Phase Transitions Related to the Pigeonhole Principle

Michiel De Smet, Andreas Weiermann, 2014, CiE.

Some Natural Zero One Laws for Ordinals Below ε 0

Alan R. Woods, Andreas Weiermann, 2012, CiE.

Ackermannian Goodstein Sequences of Intermediate Growth

Andreas Weiermann, David Fern'andez-Duque, A. Weiermann, 2020, CiE.

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

Andreas Weiermann, A. Weiermann, 1998, Journal of Symbolic Logic.

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

Eran Omri, Gyesik Lee, Andreas Weiermann, 2008, J. Comb. Theory, Ser. A.

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

Andreas Weiermann, Jeroen Van der Meeren, 2015, CiE.

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

Andrey Bovykin, Andreas Weiermann, 2017, Ann. Pure Appl. Log..

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

Andreas Weiermann, A. Weiermann, 1995, Arch. Math. Log..

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

Andreas Weiermann, 2005, Ann. Pure Appl. Log..

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

Lew Gordeev, Andreas Weiermann, A. Weiermann, 2012, Arch. Math. Log..

Relating Derivation Lengths with the Slow-Growing Hierarchy Directly

Georg Moser, Andreas Weiermann, 2003, RTA.

Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions

Andreas Weiermann, A. Weiermann, 2006, CiE.

An extremely sharp phase transition threshold for the slow growing hierarchy

Andreas Weiermann, 2006, Math. Struct. Comput. Sci..

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

Arnold Beckmann, Andreas Weiermann, 2000, Math. Log. Q..

Well-Quasi Orders in Computation, Logic, Language and Reasoning

Monika Seisenberger, Peter Schuster, Andreas Weiermann, 2020 .

Complexity Bounds for Some Finite Forms of Kruskal's Theorem

Andreas Weiermann, A. Weiermann, 1994, J. Symb. Comput..

A Simplified Characterisation of Provably Computable Functions of the System ID₁ of Inductive Definitions (Extended Abstract) (証明論と複雑性 : RIMS共同研究報告集)

Andreas Weiermann, 江口直日, 2013 .

Ordinal arithmetic with simultaneously defined theta‐functions

Andreas Weiermann, Gunnar Wilken, A. Weiermann, 2011, Math. Log. Q..

More on lower bounds for partitioning alpha-large sets

Andreas Weiermann, Henryk Kotlarski, Bozena Piekart, 2007, Ann. Pure Appl. Log..

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

Andreas Weiermann, Gunnar Wilken, 2013, Ann. Pure Appl. Log..

Classifying the Provably Total Functions of PA

Andreas Weiermann, A. Weiermann, 2006, Bulletin of Symbolic Logic.

A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions

Andreas Weiermann, Arnoud den Boer, A. Weiermann, 2007, J. Log. Comput..

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

Michael Rathjen, Andreas Weiermann, Jeroen Van der Meeren, 2014, Arch. Math. Log..

Sometimes Slow Growing is Fast Growing

Andreas Weiermann, A. Weiermann, 1997, Ann. Pure Appl. Log..

A Simplified Functorial Construction of the Veblen Hierarchy

Andreas Weiermann, 1993, Math. Log. Q..

Proving Termination for Term Rewriting Systems

Andreas Weiermann, 1991, CSL.

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

Andreas Weiermann, Gunnar Wilken, A. Weiermann, 2012, Log. Methods Comput. Sci..

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

Andreas Weiermann, 2001, J. Symb. Log..

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

Arnold Beckmann, Andreas Weiermann, 2000, Arch. Math. Log..

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

Jean Goubault-Larrecq, Monika Seisenberger, Victor L. Selivanov, 2016, Dagstuhl Reports.

Proof-Theoretic Investigations on Kruskal's Theorem

Michael Rathjen, Andreas Weiermann, A. Weiermann, 1993, Ann. Pure Appl. Log..

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

Michael Rathjen, Andreas Weiermann, Jeroen Van der Meeren, 2015, Arch. Math. Log..

How to characterize provably total functions by local predicativity

Andreas Weiermann, A. Weiermann, 1996, Journal of Symbolic Logic.

Slow consistency

Michael Rathjen, Sy-David Friedman, Andreas Weiermann, 2013, Ann. Pure Appl. Log..

Well-partial-orderings and the big Veblen number

Michael Rathjen, Andreas Weiermann, Jeroen Van der Meeren, 2015, Arch. Math. Log..

Phase transition thresholds for some Friedman‐style independence results

Andreas Weiermann, A. Weiermann, 2007, Math. Log. Q..

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

Andreas Weiermann, A. Weiermann, 1993, Math. Log. Q..

Phase transitions for Gödel incompleteness

Andreas Weiermann, A. Weiermann, 2009, Ann. Pure Appl. Log..

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

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

Bounding derivation lengths with functions from the slow growing hierarchy

Andreas Weiermann, 1998, Arch. Math. Log..

Sharp thresholds for hypergraph regressive Ramsey numbers

Gyesik Lee, Andreas Weiermann, Lorenzo Carlucci, 2011, J. Comb. Theory, Ser. A.

Gamma0 May Be Minimal Subrecursively Inaccessible

Andreas Weiermann, 2001, Math. Log. Q..

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

Andreas Weiermann, A. Weiermann, 1995, Theor. Comput. Sci..

Ackermann and Goodstein go functorial

Anton Freund, Michael Rathjen, Andreas Weiermann, 2021 .

Fast Goodstein Walks

Andreas Weiermann, David Fern'andez-Duque, 2021 .

Ackermann and Goodstein go functorial

Anton Freund, Michael Rathjen, Andreas Weiermann, 2020, Pacific Journal of Mathematics.

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

Andreas Weiermann, Florian Nicolás Pelupessy, 2012 .

Phase transitions in Proof Theory

Andreas Weiermann, Lev Gordeev, A. Weiermann, 2010 .

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

Andreas Weiermann, 2005 .

CLASSIFYING THE PHASE TRANSITION THRESHOLD FOR REGRESSIVE RAMSEY FUNCTIONS

Gyesik Lee, Andreas Weiermann, Lorenzo Carlucci, 2006 .

What Makes A (Pointwise) Subrecursive Hierarchy Slow Growing

John K. Truss, Andreas Weiermann, S. Barry Cooper, 1999 .

Γ0 May Be Minimal Subrecursively Inaccessible

Andreas Weiermann, 2001 .

A CLASSIFICATION OF RAPIDLY GROWING RAMSEY FUNCTIONS

Andreas Weiermann, A. Weiermann, 1976 .

Unprovability results involving braids

Patrick Dehornoy, Andreas Weiermann, Lorenzo Carlucci, 2007, 0711.3785.

Zero-One Law Characterizations of ε0

Andreas Weiermann, 2002 .

Reverse mathematics and well-ordering principles

Michael Rathjen, Andreas Weiermann, 2011 .

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

Andreas Weiermann, Florian Nicolás Pelupessy, 2009 .

Unprovability, phase transitions and the Riemann zeta-function

Andrey Bovykin, Andreas Weiermann, A. Bovykin, 2009 .

How to characterize provably total functions by the Buchholz operator method

Benjamin Blankertz, Andreas Weiermann, B. Blankertz, 1996 .

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

Andreas Weiermann, 1998 .

Analyzing Godel's T Via Expanded Head Reduction Trees

Arnold Beckmann, Andreas Weiermann, 2000 .