Andreas Weiermann

67 papers B 1C 9Journal 55Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Induction on dilators and Bachmann-Howard fixed points. Ann. Pure Appl. Log. Juan P. Aguilera, Anton Freund, Andreas Weiermann
2024	J	`jnl`	A Walk with Goodstein. Bull. Symb. Log. David Fernández-Duque, Andreas Weiermann
2024	J	`jnl`	Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal. Ann. Pure Appl. Log. David Fernández-Duque, Andreas Weiermann
2023	J	`jnl`	Optimal Image Transport on Sparse Dictionaries. CoRR Junqing Huang, Haihui Wang, Andreas Weiermann, Michael V. Ruzhansky
2022	J	`jnl`	Arithmetical and Hyperarithmetical Worm Battles. J. Log. Comput. David Fernández-Duque, Joost J. Joosten, Fedor Pakhomov, Konstantinos Papafilippou, Andreas Weiermann
2021	C	`ed.`	Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings CiE Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque
2021	J	`jnl`	Goodstein sequences based on a Parametrized Ackermann-Péter function. Bull. Symb. Log. Toshiyasu Arai, Stanley S. Wainer, Andreas Weiermann
2020	C	`conf`	Ackermannian Goodstein Sequences of Intermediate Growth. CiE David Fernández-Duque, Andreas Weiermann
2020	J	`jnl`	Minimal bad sequences are necessary for a uniform Kruskal theorem. CoRR Anton Freund, Michael Rathjen, Andreas Weiermann
2017	J	`jnl`	An order-theoretic characterization of the Howard-Bachmann-hierarchy. Arch. Math. Log. Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann
2017	J	`jnl`	Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition. Arch. Math. Log. Michael Rathjen, Jeroen Van der Meeren, Andreas Weiermann
2017	J	`jnl`	The strength of infinitary Ramseyan principles can be accessed by their densities. Ann. Pure Appl. Log. Andrey Bovykin, Andreas Weiermann
2016	J	`jnl`	Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports Jean Goubault-Larrecq, Monika Seisenberger, Victor L. Selivanov, Andreas Weiermann
2015	C	`conf`	How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems. CiE Jeroen Van der Meeren, Andreas Weiermann
2015	J	`jnl`	Well-partial-orderings and the big Veblen number. Arch. Math. Log. Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann
2014	C	`conf`	Phase Transitions Related to the Pigeonhole Principle. CiE Michiel De Smet, Andreas Weiermann
2013	J	`jnl`	Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0. Ann. Pure Appl. Log. Andreas Weiermann, Gunnar Wilken
2013	J	`jnl`	Slow consistency. Ann. Pure Appl. Log. Sy-David Friedman, Michael Rathjen, Andreas Weiermann
2012	J	`jnl`	Derivation Lengths Classification of Gödel's T Extending Howard's Assignment Log. Methods Comput. Sci. Gunnar Wilken, Andreas Weiermann
2012	J	`jnl`	Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. Ann. Pure Appl. Log. Michiel De Smet, Andreas Weiermann
2012	J	`jnl`	Phase transitions of iterated Higman-style well-partial-orderings. Arch. Math. Log. Lew Gordeev, Andreas Weiermann
2012	J	`jnl`	Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences. J. Log. Comput. Michiel De Smet, Andreas Weiermann
2012	C	`conf`	Some Natural Zero One Laws for Ordinals Below ε 0. CiE Andreas Weiermann, Alan R. Woods
2012	J	`jnl`	Streamlined subrecursive degree theory. Ann. Pure Appl. Log. Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann
2011	J	`jnl`	Ordinal arithmetic with simultaneously defined theta-functions. Math. Log. Q. Andreas Weiermann, Gunnar Wilken
2011	J	`jnl`	Sharp thresholds for hypergraph regressive Ramsey numbers. J. Comb. Theory A Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
2010	C	`conf`	A Miniaturisation of Ramsey's Theorem. CiE Michiel De Smet, Andreas Weiermann
2009	C	`conf`	A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. CiE Andreas Weiermann
2009	J	`jnl`	Classifying the phase transition threshold for Ackermannian functions. Ann. Pure Appl. Log. Eran Omri, Andreas Weiermann
2009	—	`conf`	Complexity of Gödel's T in lambda-Formulation. TLCA Gunnar Wilken, Andreas Weiermann
2009	J	`jnl`	Phase transitions for Gödel incompleteness. Ann. Pure Appl. Log. Andreas Weiermann
2008	C	`conf`	Phase Transitions for Weakly Increasing Sequences. CiE Michiel De Smet, Andreas Weiermann
2008	J	`jnl`	Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. J. Comb. Theory A Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
2007	J	`jnl`	A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions. J. Log. Comput. Arnoud V. den Boer, Andreas Weiermann
2007	J	`jnl`	More on lower bounds for partitioning alpha-large sets. Ann. Pure Appl. Log. Henryk Kotlarski, Bozena Piekart, Andreas Weiermann
2007	J	`jnl`	Phase transition thresholds for some Friedman-style independence results. Math. Log. Q. Andreas Weiermann
2006	J	`jnl`	An extremely sharp phase transition threshold for the slow growing hierarchy. Math. Struct. Comput. Sci. Andreas Weiermann
2006	J	`jnl`	Classifying the Provably Total Functions of PA. Bull. Symb. Log. Andreas Weiermann
2006	C	`conf`	Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. CiE Andreas Weiermann
2005	J	`jnl`	Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. Ann. Pure Appl. Log. Andreas Weiermann
2003	J	`jnl`	An application of graphical enumeration to PA*. J. Symb. Log. Andreas Weiermann
2003	J	`jnl`	An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discret. Math. Theor. Comput. Sci. Andreas Weiermann
2003	—	`conf`	Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA Georg Moser, Andreas Weiermann
2002	J	`jnl`	Slow Versus Fast Growing. Synth. Andreas Weiermann
2001	J	`jnl`	Gamma Math. Log. Q. Andreas Weiermann
2001	J	`jnl`	Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function. J. Symb. Log. Andreas Weiermann
2000	J	`jnl`	Analyzing Gödel's Math. Log. Q. Arnold Beckmann, Andreas Weiermann
2000	J	`jnl`	Characterizing the elementary recursive functions by a fragment of Gödel's T. Arch. Math. Log. Arnold Beckmann, Andreas Weiermann
1999	J	`jnl`	A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems. Stud Logica Benjamin Blankertz, Andreas Weiermann
1998	J	`jnl`	Bounding derivation lengths with functions from the slow growing hierarchy. Arch. Math. Log. Andreas Weiermann
1998	J	`jnl`	How Is It that Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. J. Symb. Log. Andreas Weiermann
1997	J	`jnl`	A proof of strongly uniform termination for Gödel's Arch. Math. Log. Andreas Weiermann
1997	J	`jnl`	Sometimes Slow Growing is Fast Growing. Ann. Pure Appl. Log. Andreas Weiermann
1997	J	`jnl`	Term Rewriting Theory for the Primitive Recursive Functions. Ann. Pure Appl. Log. E. A. Cichon, Andreas Weiermann
1996	J	`jnl`	A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Log. Arnold Beckmann, Andreas Weiermann
1996	J	`jnl`	How to Characterize Provably Total Functions by Local Predicativity. J. Symb. Log. Andreas Weiermann
1995	J	`jnl`	Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. Arch. Math. Log. Andreas Weiermann
1995	J	`jnl`	Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. Theor. Comput. Sci. Andreas Weiermann
1994	J	`jnl`	A Functorial Property of the Aczel-Buchholz-Feferman Function. J. Symb. Log. Andreas Weiermann
1994	J	`jnl`	A Uniform Approach to Fundamental Sequences and Hierarchies. Math. Log. Q. Adam Cichon, Wilfried Buchholz, Andreas Weiermann
1994	J	`jnl`	Complexity Bounds for Some Finite Forms of Kruskal's Theorem. J. Symb. Comput. Andreas Weiermann
1993	J	`jnl`	A Simplified Functorial Construction of the Veblen Hierarchy. Math. Log. Q. Andreas Weiermann
1993	J	`jnl`	An Order-Theoretic Characterization of the Schütte-Veblen-Hierarchy. Math. Log. Q. Andreas Weiermann
1993	J	`jnl`	Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions. J. Symb. Log. Andreas Weiermann
1993	J	`jnl`	Proof-Theoretic Investigations on Kruskal's Theorem. Ann. Pure Appl. Log. Michael Rathjen, Andreas Weiermann
1991	B	`conf`	Proving Termination for Term Rewriting Systems. CSL Andreas Weiermann
1991	J	`jnl`	Vereinfachte Kollabierungsfunktionen und ihre Anwendungen. Arch. Math. Log. Andreas Weiermann