Andreas Weiermann

1.1k total citations
69 papers, 419 citations indexed

About

Andreas Weiermann is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Andreas Weiermann has authored 69 papers receiving a total of 419 indexed citations (citations by other indexed papers that have themselves been cited), including 54 papers in Computational Theory and Mathematics, 25 papers in Geometry and Topology and 17 papers in Artificial Intelligence. Recurrent topics in Andreas Weiermann's work include Computability, Logic, AI Algorithms (33 papers), Advanced Topology and Set Theory (20 papers) and Advanced Algebra and Logic (19 papers). Andreas Weiermann is often cited by papers focused on Computability, Logic, AI Algorithms (33 papers), Advanced Topology and Set Theory (20 papers) and Advanced Algebra and Logic (19 papers). Andreas Weiermann collaborates with scholars based in Belgium, Germany and United Kingdom. Andreas Weiermann's co-authors include Michael Rathjen, Wilfried Buchholz, Arnold Beckmann, Sy‐David Friedman, Lars Kristiansen, Eran Omri, Harvey M. Friedman, Toshiyasu Arai, Patrick Dehornoy and Peter Schuster and has published in prestigious journals such as Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences, Advances in Mathematics and Theoretical Computer Science.

In The Last Decade

Andreas Weiermann

64 papers receiving 378 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Andreas Weiermann Belgium 10 345 171 137 55 40 69 419
Alan R. Woods Australia 10 304 0.9× 206 1.2× 51 0.4× 44 0.8× 27 0.7× 16 378
J. K. Truss United Kingdom 12 310 0.9× 63 0.4× 340 2.5× 111 2.0× 6 0.1× 79 501
Wilfried Buchholz Germany 11 338 1.0× 278 1.6× 85 0.6× 13 0.2× 16 0.4× 25 423
Arno Pauly United Kingdom 11 257 0.7× 115 0.7× 95 0.7× 7 0.1× 31 0.8× 48 295
Henryk Kotlarski Poland 11 195 0.6× 85 0.5× 169 1.2× 34 0.6× 4 0.1× 35 311
Harold Simmons United Kingdom 11 216 0.6× 125 0.7× 157 1.1× 9 0.2× 5 0.1× 44 421
Theodore A. Slaman United States 17 974 2.8× 309 1.8× 400 2.9× 34 0.6× 186 4.7× 92 1.0k
Richard Mansfield United States 7 169 0.5× 40 0.2× 176 1.3× 41 0.7× 5 0.1× 29 288
Sabine Koppelberg Germany 7 242 0.7× 70 0.4× 197 1.4× 14 0.3× 12 0.3× 26 359
Alberto Marcone Italy 9 184 0.5× 53 0.3× 111 0.8× 12 0.2× 25 0.6× 32 218

Countries citing papers authored by Andreas Weiermann

Since Specialization
Citations

This map shows the geographic impact of Andreas Weiermann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andreas Weiermann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andreas Weiermann more than expected).

Fields of papers citing papers by Andreas Weiermann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andreas Weiermann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andreas Weiermann. The network helps show where Andreas Weiermann may publish in the future.

Co-authorship network of co-authors of Andreas Weiermann

This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Weiermann. A scholar is included among the top collaborators of Andreas Weiermann based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andreas Weiermann. Andreas Weiermann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Weiermann, Andreas, et al.. (2024). Functorial Fast-Growing Hierarchies. Forum of Mathematics Sigma. 12. 1 indexed citations
2.
Arai, Toshiyasu, Stanley S. Wainer, & Andreas Weiermann. (2021). GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION. Bulletin of Symbolic Logic. 27(2). 168–186.
3.
Schuster, Peter, et al.. (2020). Well-Quasi Orders in Computation, Logic, Language and Reasoning. arXiv (Cornell University). 3 indexed citations
4.
Arai, Toshiyasu, David Fernández–Duque, Stanley S. Wainer, & Andreas Weiermann. (2019). Predicatively unprovable termination of the Ackermannian Goodstein process. Proceedings of the American Mathematical Society. 148(8). 3567–3582. 2 indexed citations
5.
Weiermann, Andreas, et al.. (2017). The strength of infinitary Ramseyan principles can be accessed by their densities. Annals of Pure and Applied Logic. 168(9). 1700–1709. 3 indexed citations
6.
Weiermann, Andreas, et al.. (2013). Goodstein sequences for prominent ordinals up to the ordinal ofΠ11CA0. Annals of Pure and Applied Logic. 164(12). 1493–1506. 1 indexed citations
7.
Weiermann, Andreas, et al.. (2012). Derivation Lengths Classification of G\"odel's T Extending Howard's Assignment. Logical Methods in Computer Science. Volume 8, Issue 1. 1 indexed citations
8.
Friedman, Sy‐David, Michael Rathjen, & Andreas Weiermann. (2012). Slow consistency. Annals of Pure and Applied Logic. 164(3). 382–393. 8 indexed citations
9.
Kristiansen, Lars, et al.. (2011). Streamlined subrecursive degree theory. Annals of Pure and Applied Logic. 163(6). 698–716. 6 indexed citations
10.
Weiermann, Andreas, et al.. (2011). Goodstein sequences for prominent ordinals up to the Bachmann–Howard ordinal. Annals of Pure and Applied Logic. 163(6). 669–680. 1 indexed citations
11.
Smet, M. De & Andreas Weiermann. (2010). Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences. Journal of Logic and Computation. 22(2). 207–211. 1 indexed citations
12.
Weiermann, Andreas. (2008). Phase transitions for Gödel incompleteness. Annals of Pure and Applied Logic. 157(2-3). 281–296. 5 indexed citations
13.
Weiermann, Andreas, et al.. (2007). Mini-workshop: Logic, Combinatorics and Independence Results. Oberwolfach Reports. 3(4). 3087–3130. 2 indexed citations
14.
Weiermann, Andreas. (2005). Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. Annals of Pure and Applied Logic. 136(1-2). 189–218. 16 indexed citations
15.
Weiermann, Andreas. (2005). Analytic combinatorics for a certain well-ordered class of iterated exponential terms. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AD,...(Proceedings). 1 indexed citations
16.
Weiermann, Andreas. (2003). A classification of rapidly growing Ramsey functions. Proceedings of the American Mathematical Society. 132(2). 553–561. 21 indexed citations
17.
Weiermann, Andreas. (2001). Some interesting connections between the slow growing hierarchy and the Ackermann function. Journal of Symbolic Logic. 66(2). 609–628. 4 indexed citations
18.
Weiermann, Andreas. (1995). Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths. Theoretical Computer Science. 139(1-2). 355–362. 29 indexed citations
19.
Weiermann, Andreas. (1994). Complexity Bounds for Some Finite Forms of Kruskal's Theorem. Journal of Symbolic Computation. 18(5). 463–488. 9 indexed citations
20.
Rathjen, Michael & Andreas Weiermann. (1993). Proof-theoretic investigations on Kruskal's theorem. Annals of Pure and Applied Logic. 60(1). 49–88. 53 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026