Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works cited by this work

21 works

Work: Unoids with Finiteness Conditions over Computably Separable Equivalences

  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. Algebras over negative equivalences

    N. Kh. Kasymov

    Article199413 citations
    ABI

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

    J. A. Bergstra, John V. Tucker

    Chapter198013 citations
    ABI

  6. CONSTRUCTIVE ALGEBRAS I

    A. I. Malʹt︠s︡ev

    Article196112 citations
    ABI

  7. Positive algebras with countable congruence lattices

    N. Kh. Kasymov

    Article199212 citations
    ABI

  8. Homomorphisms onto negative algebras

    N. Kh. Kasymov

    Article199212 citations
    ABI

  9. Algebras with finitely approximable positively representable enrichments

    N. Kh. Kasymov

    Article198711 citations
    ABI

  10. Recursively Enumerable Sets and Degrees

    Robert I. Soare

    Book198710 citations
    ABI

  11. Positive algebras with congruences of finite index

    N. Kh. Kasymov

    Article199110 citations
    ABI

  12. Positive algebras with nonetherian congruence lattices

    N. Kh. Kasymov

    Article19929 citations
    ABI

  13. Untitled

    Other9 citations
    ABI

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

    Article20229 citations
    ABI

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

  16. Theory of Numberings

    Yuri L. Ershov

    Chapter19996 citations
    ABI

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

  18. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations
    ABI

  19. Weakly semirecursive sets

    Carl G. Jockusch, James C. Owings

    Article19904 citations
    ABI

  20. On effectively hypersimple sets

    M. M. Arslanov

    Article19692 citations
    ABI

  21. Universal Generalized Computable Numberings and Hyperimmunity

    M. Kh. Faĭzrakhmanov

    Article20172 citations
    ABI