Rogers semilattices of punctual numberings
Sign Up to like & getrecommendations! Published in 2022 at "Mathematical Structures in Computer Science"
DOI: 10.1017/s0960129522000093
Abstract: Abstract The paper works within the framework of punctual computability, which is focused on eliminating unbounded search from constructions in algebra and infinite combinatorics. We study punctual numberings, that is, uniform computations for families S… read more here.
Keywords: primitive recursive; rogers semilattices; semilattices punctual; punctual numberings ... See more keywords
Rogers Semilattices for Families of Equivalence Relations in the Ershov Hierarchy
Sign Up to like & getrecommendations! 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