Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Arithmetical Transfinite Recursion"”.
-
Grätzer-Schmidt Theorem In Arithmetical Transfinite Recursion
… (Pi11-CA0) and its restrictive variant GSD in arithmetical comprehension (ACA0). In this paper, it will be shown that the arithmetical transfinite recursion (ATR0) is sufficient to prove GS. Additionally, other variations of GS will be explored as well. Some will be proved in ACA0, while others …
-
At the limits of predicativity: the reverse mathematics of ordering relations
… that are at least strong enough to prove arithmetical transfinite recursion. One example is that of a theorem by Dushnik and Miller, which states that a countable linear order is a well order precisely when its initial segments cannot be collapsed via embeddings. Our analysis shows that …
-
Measuring the Relative Complexity of Mathematical Constructions and Theorems
… with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computable reducibilities, in particular Weihrauch reducibility. We show that it is equally hard to construct an embedding between two given well-orderings, as it is to …