6 citations · 9 across the 2 of their papers we have counts for
2 papers
math.LO2019★ 3 cited
Isomorphism types of Rogers semilattices in the analytical hierarchy
Nikolay Bazhenov, Sergey Ospichev, Mars Yamaleev
A numbering of a countable family is a surjective map from the set of natural numbers onto . A numbering is reducible to a numbering if there is an effective pro…
math.LO2018★ 6 cited
Classifying equivalence relations in the Ershov hierarchy
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro +2
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\…