Weak and strong versions of Effective Transfinite Recursion
نویسندگان
چکیده
Working in the context of reverse mathematics, we give a fine-grained characterization result on strength two possible definitions for Effective Transfinite Recursion used literature. Moreover, show that Π20-induction along well-order X is equivalent to statement exponentiation any power well-founded.
منابع مشابه
Ranked Structures and Arithmetic Transfinite Recursion
ATR0 is the natural subsystem of second-order arithmetic in which one can develop a decent theory of ordinals. We investigate classes of structures which are in a sense the “well-founded part” of a larger, simpler class, for example, superatomic Boolean algebras (within the class of all Boolean algebras). The other classes we study are: well-founded trees, reduced Abelian p-groups, and countabl...
متن کاملTransfinite recursion and computation in the iterative conception of set
Transfinite recursion is an essential component of set theory. In this paper, we seek intrinsically justified reasons for believing in recursion and the notions of higher computation that surround it. In doing this, we consider several kinds of recursion principles and prove results concerning their relation to one another. We then consider philosophical motivations for these formal principles ...
متن کاملStrong Topological Regularity and Weak Regularity of Banach Algebras
In this article we study two different generalizations of von Neumann regularity, namely strong topological regularity and weak regularity, in the Banach algebra context. We show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. Then we consider strong topological regularity of certain concrete algebras. Moreover we obtain ...
متن کاملAutonomous fixed point progressions and fixed point transfinite recursion
This paper is a contribution to the area of metapredicative proof theory. It continues recent investigations on the transfinitely iterated fixed point theories ÎDα (cf. [10]) and addresses the question of autonomity in iterated fixed point theories. An external and an internal form of autonomous generation of transfinite hierarchies of fixed points of positive arithmetic operators are introduce...
متن کاملDeterminacy and Π 11 transfinite recursion along ω
It is known that almost all important set existence axioms in second order arithmetic can be characterized by determinacy schemes of infinite games. In this article, we sketch the proof of the equivalence between Π1 transfinite recursion along ω and determinacy scheme.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2023
ISSN: ['0168-0072', '1873-2461']
DOI: https://doi.org/10.1016/j.apal.2022.103232