15 citations · 26 across the 27 of their papers we have counts for
4 papers · 1 filter
Extensional realizability for intuitionistic set theory
Emanuele Frittaion, Michael Rathjen
In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring tha…
Ackermann and Goodstein go functorial
Juan P. Aguilera, Anton Freund, Michael Rathjen +1
We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These…
Well-Ordering Principles in Proof Theory and Reverse Mathematics
Michael Rathjen
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial m…
Minimal bad sequences are necessary for a uniform Kruskal theorem
Anton Freund, Michael Rathjen, Andreas Weiermann
The minimal bad sequence argument due to Nash-Williams is a powerful tool in combinatorics with important implications for theoretical computer science. In particular, it yields a…