Kalmurzayev Bs 1

1. Computable Reducibility for Computable Linear Orders of Type ω
2. A NOTE ON THE STRUCTURE OF MINIMAL DARK CEERS
3. On diagonal functions for equivalence relations
4. SPECIAL CLASSES OF POSITIVE PREORDERS
5. Punctual Dimension of Algebraic Structures in Certain Classes
6. GENERALIZED NUMBERING FOR LINEAR ORDERS
7. ON UNIVERSAL NUMBERINGS OF GENERALIZED COMPUTABLE FAMILIES
8. Computably enumerable equivalence relations via primitive recursive reductions
9. Index Sets for Classes of Positive Preorders
10. Undecidability of the degree structure of primitive recursive m-reducibility
11. Minimal Generalized Computable Numberings and Families of Positive Preorders
1