Ушбу иш иқтибос қилган ишлар

14 та иш

Иш: Logical specifications of effectively separable data models

Homomorphisms onto effectively separable algebras
N. Kh. Kasymov
МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201619 иқтибос
ABI
Enumerated algebras with uniformly recursive-separable classes
N. Kh. Kasymov
Мақола199316 иқтибос
ABI
A characterisation of computable data types by means of a finite equational specification method
J. A. Bergstra, John V. Tucker
Боб198013 иқтибос
ABI
Separation axioms and partitions of the set of natural numbers
N. Kh. Kasymov
Мақола199313 иқтибос
ABI
$$\Pi^0_1$$ -Presentations of Algebras
Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin
Мақола200612 иқтибос
ABI
Сарлавҳасиз
Бошқа9 иқтибос
ABI
ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
Uri Andrews, DANIEL F. BELIN, Luca San Mauro
Мақола20229 иқтибос
ABI
Рекурсивно отделимые нумерованные алгебры
Надим Хабибуллаевич Касымов, Надим Хабибуллаевич Касымов
Мақола19968 иқтибос
ABI
Negative Dense Linear Orders
N. Kh. Kasymov, R. N. Dadazhanov
МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 иқтибос
ABI
Finitely presented expansions of groups, semigroups, and algebras
Bakhadyr Khoussainov, Alexei Miasnikov
Мақола20134 иқтибос
ABI
Separable Algorithmic Representations of Classical Systems and Their Applications
N. Kh. Kasymov, R. N. Dadazhanov, F. N. Ibragimov
МақолаAdvanced Data Processing TechniquesContemporary Mathematics Fundamental Directions20213 иқтибос
ABI
$T_1$-separable numberings of subdirectly indecomposable algebras
N. Kh. Kasymov, Andrey Morozov, I. A. Khodzhamuratova
Мақола20213 иқтибос
ABI
Randomness, computability and algebraic specifications
Bakhadyr Khoussainov
Мақола19982 иқтибос
ABI
Сарлавҳасиз
Бошқа1 иқтибос
ABI