bazhenov-na 1

1. On the Theory of Computably Enumerable Linear Preorders with Concatenation
2. Computable Reducibility for Computable Linear Orders of Type ω
3. On diagonal functions for equivalence relations
4. On Weakly Coholographic Structures
5. On Universal Pairs in the Ershov Hierarchy
6. Theories of Rogers Semilattices of Analytical Numberings
7. On Universal Positive Graphs
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