Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works cited by this work

22 works

Work: Logical Specifications of Effectively Separable Data 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. $$\Pi^0_1$$ -Presentations of Algebras

    Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin

    Article200612 citations
    ABI

  8. Positive algebras with countable congruence lattices

    N. Kh. Kasymov

    Article199212 citations
    ABI

  9. Homomorphisms onto negative algebras

    N. Kh. Kasymov

    Article199212 citations
    ABI

  10. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic201611 citations
    ABI

  11. Algebras with finitely approximable positively representable enrichments

    N. Kh. Kasymov

    Article198711 citations
    ABI

  12. Positive algebras with congruences of finite index

    N. Kh. Kasymov

    Article199110 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. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic20217 citations
    ABI

  16. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 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. Finitely presented expansions of groups, semigroups, and algebras

    Bakhadyr Khoussainov, Alexei Miasnikov

    Article20134 citations
    ABI

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

  20. Untitled

    Other2 citations
    ABI

  21. Randomness, computability and algebraic specifications

    Bakhadyr Khoussainov

    Article19982 citations
    ABI

  22. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20221 citations
    ABI