Работы, на которые ссылается эта работа

Работ: 9

Работа: Negativity of effectively separable numberings of fields the finite characteristic

Homomorphisms onto effectively separable algebras
N. Kh. Kasymov
СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2016Цитирований: 19
ABI
Enumerated algebras with uniformly recursive-separable classes
N. Kh. Kasymov
Статья1993Цитирований: 16
ABI
Recursively separable enumerated algebras
N. Kh. Kasymov
Статья1996Цитирований: 15
ABI
Separation axioms and partitions of the set of natural numbers
N. Kh. Kasymov
Статья1993Цитирований: 13
ABI
ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
Uri Andrews, DANIEL F. BELIN, Luca San Mauro
Статья2022Цитирований: 9
ABI
Separable Enumerations of Division Rings and Effective Embeddability of Rings Therein
N. Kh. Kasymov, F. N. Ibragimov
СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2019Цитирований: 8
ABI
T1-Separable Numberings of Subdirectly Indecomposable Algebras
N. Kh. Kasymov, Andrey Morozov, I. A. Khodzhamuratova
СтатьяComputability, Logic, AI AlgorithmsAlgebra and Logic2021Цитирований: 7
ABI
Separable Algorithmic Representations of Classical Systems and their Applications
N. Kh. Kasymov, R. N. Dadazhanov, F. N. Ibragimov
СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2024Цитирований: 4
ABI
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
Uri Andrews, Steffen Lempp, Joseph S. Miller +3
Статья2014Цитирований: 4
ABI