Mustafa M 1

1. The first-order theory of the computably enumerable equivalence relations in the uncountable setting
2. On diagonal functions for equivalence relations
3. One-Element Rogers Semilattices in the Ershov Hierarchy
4. Identities and Quasi-Identities of Pointed Algebras
5. Computable embeddability for algebraic structures
6. How to approximate fuzzy sets: mind-changes and the Ershov Hierarchy
7. On Concept Lattices for Numberings
8. On learning down-sets in quasi-orders, and ideals in Boolean algebras
9. On Universal Pairs in the Ershov Hierarchy
10. Rogers semilattices of limitwise monotonic numberings
11. Rogers semilattices of punctual numberings
12. Theories of Rogers Semilattices of Analytical Numberings
13. Dominated convergence theorems in Haagerup noncommutative L_p -spaces
14. Free bicommutative superalgebras
15. The algebraic and geometric classification of nilpotent right alternative algebras
16. Representations via differential algebras and equationally Noetherian algebras
17. A Note on Hardy Type Inequalities For Quaternion-valued Functions
18. Circular economy: Challenges and opportunities in the construction sector of Kazakhstan
1