Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works cited by this work

18 works

Work: Computability and Universal Determinability of Negatively Representable Models

  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. Separation axioms and partitions of the set of natural numbers

    N. Kh. Kasymov

    Article199313 citations
    ABI

  7. CONSTRUCTIVE ALGEBRAS I

    A. I. Malʹt︠s︡ev

    Article196112 citations
    ABI

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

    Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin

    Article200612 citations
    ABI

  9. Positive algebras with countable congruence lattices

    N. Kh. Kasymov

    Article199212 citations
    ABI

  10. Homomorphisms onto negative algebras

    N. Kh. Kasymov

    Article199212 citations
    ABI

  11. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic201611 citations
    ABI

  12. Algebras with finitely approximable positively representable enrichments

    N. Kh. Kasymov

    Article198711 citations
    ABI

  13. Positive algebras with congruences of finite index

    N. Kh. Kasymov

    Article199110 citations
    ABI

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

  15. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 citations
    ABI

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

  17. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 citations
    ABI

  18. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20204 citations
    ABI