4 citations · 6 across the 4 of their papers we have counts for
4 papers · 1 filter
Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev +1
Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order…
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…
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…
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 $\…