Sign Up to like & get
recommendations!
1
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
Sign Up to like & get
recommendations!
0
Published in 2019 at "Siberian Mathematical Journal"
DOI: 10.1134/s0037446619020046
Abstract: The paper studies Rogers semilattices for families of equivalence relations in the Ershov hierarchy. For an arbitrary notation a of a nonzero computable ordinal, we consider $$\sum\nolimits_a^{- 1} {}$$∑a−1-computable numberings of the family of all…
read more here.
Keywords:
equivalence relations;
rogers semilattices;
ershov hierarchy;
semilattices families ... See more keywords