Negativity of effectively separable numberings of fields the finite characteristic
https://doi.org/10.26907/2949-3919.2025.2.19-31
Abstract
We establishe that the eff ely non-degenerate numbering of any field of the finite characteristic is negative.
Keywords
Supporting agencies: The work is performed under the development program of Volga Region Mathematical Center (agreement no. 075-02-2025-1725/1).
About the Authors
N. Kh. Kasymov
National University of Uzbekistan
Uzbekistan
Nadimulla Khabibullaevich Kasymov
Uzbekistan
Nadimulla Khabibullaevich Kasymov
4 Universitetskaya str., Tashkent 100174
N. R Karimova
National University of Uzbekistan
Uzbekistan
Nodira Ruzimat kizi Karimova
Uzbekistan
Nodira Ruzimat kizi Karimova
4 Universitetskaya str., Tashkent 100174
E. A. Khodzhamuratova
Tashkent International University of Financial Management and Technology
Uzbekistan
Indira Azatovna Khodzhamuratova
Uzbekistan
Indira Azatovna Khodzhamuratova
6A Kichik Xalqa Yuli str., Tashkent 100121
References
1. Yu.L. Ershov, Decidability problems and constructive models, Nauka, M., 1980 [in Russian]. [
2. S.S. Goncharov, Yu.L. Ershov, Constructive models, Siberian School of Algebra and Logic.Consultants Bureau, New York, 2000.
3. N.Kh. Kasymov, Recursively separable enumerated algebras, Russian Math. Surveys 51 (3), 509–538 (1996). DOI: https://doi.org/10.1070/RM1996v051n03ABEH002913
4. N.Kh. Kasymov, R.N. Dadazhanov, F.N. Ibragimov, Separable algorithmic representations of classical systems and their applications, J. Math. Sci. 278 (3), 476–519 (2024). DOI: https://doi.org/10.1007/s10958-024-06934-3
5. U. Andrews, S. Lempp, J.S. Miller, K.M. Ng, L.S. Mauro, A. Sorbi, Universal computably enumerable equivalence relations, J. Symb. Logic 79 (1), 60–88 (2014). DOI: http://doi.org/10.1017/jsl.2013.8
6. U. Andrews, D.F. Belin, L. San Mauro, On the structure of computable reducibility on equivalence relations of natural numbers, J. Symb. Logic 88 (3), 1038–1063 (2023). DOI: https://doi.org/10.1017/jsl.2022.28
7. Yu.L. Ershov, Theory of numberings, Nauka, M., 1977 [in Russian].
8. N.Kh. Kasymov, Homomorphisms onto eff ctively separable algebras, Siberian Math. J. 57 (1), 36–50 (2016). DOI: https://doi.org/10.1134/S0037446616010055
9. N.Kh. Kasymov, A.S. Morozov, I.A. Khodzhamuratova, T1-separable numberings of subdirectly indecomposable algebras, Algebra and Logic 60 (4), 263–278 (2021). URL: https://doi.org/10.1007/s10469-021-09651-x
10. N.Kh. Kasymov, Enumerated algebras with uniformly recursive-separable classes, Siberian Math. J. 34 (5), 869–882 (1993). DOI: https://doi.org/10.1007/BF00971403
11. N.Kh. Kasymov, Separation axioms and partitions of the set of natural numbers, Siberian Math. J. 34 (3), 468–471 (1993). DOI: https://doi.org/10.1007/BF00971221
12. N.Kh. Kasymov, F.N. Ibragimov, Separable enumerations of division rings and eff ctive embeddability of rings therein, Siberian Math. J. 60 (1), 62–70 (2019). DOI: https://doi.org/10.1134/S0037446619010075
Review
For citations:
Kasymov N.Kh., Karimova N.R., Khodzhamuratova E.A. Negativity of effectively separable numberings of fields the finite characteristic. Mathematics and Theoretical Computer Science. 2025;3(2):19-31. (In Russ.) https://doi.org/10.26907/2949-3919.2025.2.19-31
Views:
80
Email this article 