prof. Andreas Weiermann
- Work address
-
Krijgslaan 281, S8
9000 Gent - Andreas.Weiermann@UGent.be
- ORCID iD
-
0000-0002-5561-5323
Show
Sort by
-
Arithmetical and Hyperarithmetical Worm Battles
-
Minimal bad sequences are necessary for a uniform Kruskal theorem
-
- Journal Article
- A1
- open access
Boundedness theorems for flowers and sharps
-
- Journal Article
- A1
- open access
Ackermann and Goodstein go functorial
-
Goodstein sequences on a parametrized Ackermann-Peter function
-
Connecting with computability
Liesbeth De Mol, Andreas Weiermann (UGent) , Florin Manea and David Fernández-Duque (UGent) -
Well-quasi orders in computation, logic, language and reasoning : a unifying concept of proof theory, automata theory, formal languages and descriptive set theory
Peter M. Schuster, Monika Seisenberger and Andreas Weiermann (UGent) -
- Conference Paper
- C1
- open access
Ackermannian Goodstein sequences of intermediate growth
-
Calculating maximal order types for finite rooted unstructured labeled trees
-
Predicatively unprovable termination of the Ackermannian Goodstein process