The first-order theory of the computably enumerable equivalence relations in the uncountable setting
From MaRDI portal
Publication:5028304
DOI10.1093/logcom/exab045OpenAlexW3186371800MaRDI QIDQ5028304
Noah Schweber, Uri Andrews, Steffen Lempp, Manat Mustafa
Publication date: 8 February 2022
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exab045
first-order theory\(\alpha\)-recursiondegree structureceers (c.e. equivalence relations)uncountable computability
Related Items (max. 100)
Uniformly computably separable algebras with effectively splittable families of negative congruences
This page was built for publication: The first-order theory of the computably enumerable equivalence relations in the uncountable setting