Weakly Precomplete Equivalence Relations in the Ershov Hierarchy
Sign Up to like & getrecommendations! Published in 2019 at "Algebra and Logic"
DOI: 10.1007/s10469-019-09538-y
Abstract: We study the computable reducibility ≤c for equivalence relations in the Ershov hierarchy. For an arbitrary notation a for a nonzero computable ordinal, it is stated that there exist a $$ {\varPi}_a^{-1} $$ -universal equivalence… read more here.
Keywords: weakly precomplete; equivalence; equivalence relations; relations ershov ... See more keywords