Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

8 works

Work: On computable automorphisms of the rational numbers

  1. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic201611 citations
    ABI

  2. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 citations
    ABI

  3. Structures of Degrees of Negative Representations of Linear Orders

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

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20215 citations
    ABI

  4. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations
    ABI

  5. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 citations
    ABI

  6. Separable Algorithmic Representations of Classical Systems and their Applications

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

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 citations
    ABI

  7. Separable Algorithmic Representations of Classical Systems and Their Applications

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

    ArticleAdvanced Data Processing TechniquesContemporary Mathematics Fundamental Directions20213 citations
    ABI

  8. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsContemporary Mathematics Fundamental Directions20181 citations
    ABI