We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
What is effective transfinite recursion in reverse mathematics?
- Authors
Freund, Anton
- Abstract
In the context of reverse mathematics, effective transfinite recursion refers to a principle that allows us to construct sequences of sets by recursion along arbitrary well orders, provided that each set is Δ10‐definable relative to the previous stages of the recursion. It is known that this principle is provable in ACA0. In the present note, we argue that a common formulation of effective transfinite recursion is too restrictive. We then propose a more liberal formulation, which appears very natural and is still provable in ACA0.
- Subjects
REVERSE mathematics
- Publication
Mathematical Logic Quarterly, 2020, Vol 66, Issue 4, p479
- ISSN
0942-5616
- Publication type
Article
- DOI
10.1002/malq.202000042