6 citations · 12 across the 7 of their papers we have counts for
7 papers
Free bicommutative superalgebras
Vesselin Drensky, Nurlan Ismailov, Manat Mustafa +1
We introduce the variety of bicommutative superalgebras over an arbitrary field of characteristic different from 2. The variety consists of all nonas…
Representations via differential algebras and equationally Noetherian algebras
Alexander A. Mikhalev, Manat Mustafa, Ualbai Umirbaev
We show that free algebras of the variety of algebras generated by the Witt algebra , the left-symmetric Witt algebra , and the symplectic Poisson algebra can be de…
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…
The algebraic and geometric classification of nilpotent right alternative algebras
Nurlan Ismailov, Ivan Kaygorodov, Manat Mustafa
We present algebraic and geometric classifications of the -dimensional complex nilpotent right alternative algebras. Specifically, we find that, up to isomorphism, there are onl…
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 $\…