Year: 2020
Type: article
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 ‐definable relative to the previous stages of the recursion. It is known that this principle is provable in . 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 .
Source: Mathematical logic quarterly
Author: Anton Freund
Institution: Technische Universität Darmstadt
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,500
OpenAlex ID: W3035401974