Перейти к основному содержанию
AkademIndex

Продукты

Для разработчиков

AkademBaseОткрытый API экосистемы
← Назад к работе

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

Работ: 22

Работа: Logical Specifications of Effectively Separable Data Models

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2016Цитирований: 19
    ABI

  2. Enumerated algebras with uniformly recursive-separable classes

    N. Kh. Kasymov

    Статья1993Цитирований: 16
    ABI

  3. Recursively separable enumerated algebras

    N. Kh. Kasymov

    Статья1996Цитирований: 15
    ABI

  4. Algebras over negative equivalences

    N. Kh. Kasymov

    Статья1994Цитирований: 13
    ABI

  5. A characterisation of computable data types by means of a finite equational specification method

    J. A. Bergstra, John V. Tucker

    Глава1980Цитирований: 13
    ABI

  6. Separation axioms and partitions of the set of natural numbers

    N. Kh. Kasymov

    Статья1993Цитирований: 13
    ABI

  7. $$\Pi^0_1$$ -Presentations of Algebras

    Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin

    Статья2006Цитирований: 12
    ABI

  8. Positive algebras with countable congruence lattices

    N. Kh. Kasymov

    Статья1992Цитирований: 12
    ABI

  9. Homomorphisms onto negative algebras

    N. Kh. Kasymov

    Статья1992Цитирований: 12
    ABI

  10. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    СтатьяComputability, Logic, AI AlgorithmsAlgebra and Logic2016Цитирований: 11
    ABI

  11. Algebras with finitely approximable positively representable enrichments

    N. Kh. Kasymov

    Статья1987Цитирований: 11
    ABI

  12. Positive algebras with congruences of finite index

    N. Kh. Kasymov

    Статья1991Цитирований: 10
    ABI

  13. Без названия

    ДругоеЦитирований: 9
    ABI

  14. ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

    Статья2022Цитирований: 9
    ABI

  15. T1-Separable Numberings of Subdirectly Indecomposable Algebras

    N. Kh. Kasymov, Andrey Morozov, I. A. Khodzhamuratova

    СтатьяComputability, Logic, AI AlgorithmsAlgebra and Logic2021Цитирований: 7
    ABI

  16. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2017Цитирований: 6
    ABI

  17. Structures of Degrees of Negative Representations of Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov, S. K. Djavliev

    СтатьяComputability, Logic, AI AlgorithmsRussian Mathematics2021Цитирований: 5
    ABI

  18. Finitely presented expansions of groups, semigroups, and algebras

    Bakhadyr Khoussainov, Alexei Miasnikov

    Статья2013Цитирований: 4
    ABI

  19. Separable Algorithmic Representations of Classical Systems and Their Applications

    N. Kh. Kasymov, R. N. Dadazhanov, F. N. Ibragimov

    СтатьяAdvanced Data Processing TechniquesContemporary Mathematics Fundamental Directions2021Цитирований: 3
    ABI

  20. Без названия

    ДругоеЦитирований: 2
    ABI

  21. Randomness, computability and algebraic specifications

    Bakhadyr Khoussainov

    Статья1998Цитирований: 2
    ABI

  22. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    СтатьяComputability, Logic, AI AlgorithmsRussian Mathematics2022Цитирований: 1
    ABI