2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.LO2020★ 2 cited
Rogers semilattices in the analytical hierarchy: The case of finite families
Nikolay Bazhenov, Manat Mustafa
A numbering of a countable family is a surjective map from the set of natural numbers onto . The paper studies Rogers semilattices, i.e. upper semilattices induced by th…
math.LO2019
Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro +1
A standard tool for classifying the complexity of equivalence relations on is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The…
math.LO2018
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 $\…