3 citations · 6 across the 9 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.LO2022
The uniform Kruskal theorem: between finite combinatorics and strong set existence
Anton Freund, Patrick Uftring
The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to -c…
math.LO2022★ 3 cited
Weak and Strong Versions of Effective Transfinite Recursion
Patrick Uftring
Working in the context of reverse mathematics, we give a fine-grained characterization result on the strength of two possible definitions for Effective Transfinite Recursion used i…