The first-order theory of the computably enumerable equivalence relations in the uncountable setting

Uri Andrews, Steffen Lempp, Manat Mustafa, Noah Schweber · Journal of Logic and Computation · 2021

Abstract 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.

Read the paper · More papers on PaperTik