The first-order theory of the computably enumerable equivalence relations in the uncountable setting
Andrews U. Lempp S. Mustafa M. Schweber N.D.
1 January 2022Oxford University Press
Journal of Logic and Computation
2022#32Issue 198 - 114 pp.
We generalize the analysis of Andrews, Schweber and Sorbi of the first-order theory of the partial order of degrees of c.e. equivalence relations to higher computability theory, specifically to the setting of a regular cardinal.
Ceers (c.e. equivalence relations) , Degree structure , First-order theory , Uncountable computability , Α -recursion
Text of the article Перейти на текст статьи
Department of Mathematics, University of Wisconsin, Madison, 53706-1325, WI, United States
Department of Mathematics, School of Science and Humanities, Nazarbayev University, 53 Kabanbay Batyr Ave, Nur-Sultan, 010000, Kazakhstan
Department of Mathematics
Department of Mathematics
10 лет помогаем публиковать статьи Международный издатель
Книга Публикация научной статьи Волощук 2026 Book Publication of a scientific article 2026