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

Продукты

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

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

Работы, цитирующие эту работу

Работ: 8

Работа: On computable automorphisms of the rational numbers

  1. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

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

  2. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

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

  3. 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

  4. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

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

  5. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2022Цитирований: 4
    ABI

  6. 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

  7. 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

  8. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    СтатьяComputability, Logic, AI AlgorithmsContemporary Mathematics Fundamental Directions2018Цитирований: 1
    ABI