Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works cited by this work

9 works

Work: Negativity of effectively separable numberings of fields the finite characteristic

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201619 citations
    ABI

  2. Enumerated algebras with uniformly recursive-separable classes

    N. Kh. Kasymov

    Article199316 citations
    ABI

  3. Recursively separable enumerated algebras

    N. Kh. Kasymov

    Article199615 citations
    ABI

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

    N. Kh. Kasymov

    Article199313 citations
    ABI

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

    Article20229 citations
    ABI

  6. Separable Enumerations of Division Rings and Effective Embeddability of Rings Therein

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20198 citations
    ABI

  7. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic20217 citations
    ABI

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

  9. UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

    Uri Andrews, Steffen Lempp, Joseph S. Miller +3

    Article20144 citations
    ABI