What is effective transfinite recursion in reverse mathematics?
From MaRDI portal
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 .
Recommendations
Cites work
Cited in
(4)
This page was built for publication: What is effective transfinite recursion in reverse mathematics?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047666)