Skip to main content
AkademIndex

Products

For developers

AkademBasesoonOpen API for the ecosystem
Latin
← Back to work

Works cited by this work

21 works

Work: Finite 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. A characterisation of computable data types by means of a finite equational specification method

    J. A. Bergstra, John V. Tucker

    Chapter198013 citations
    ABI

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

    N. Kh. Kasymov

    Article199313 citations
    ABI

  6. CONSTRUCTIVE ALGEBRAS I

    A. I. Malʹt︠s︡ev

    Article196112 citations
    ABI

  7. Positive algebras with nonetherian congruence lattices

    N. Kh. Kasymov

    Article19929 citations
    ABI

  8. Untitled

    Other9 citations
    ABI

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

    Article20229 citations
    ABI

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

  11. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic20217 citations
    ABI

  12. Existential quantifiers in abstract data types

    Manfred Broy, Walter Dosch, H. Partsch +2

    Chapter19797 citations
    ABI

  13. Some definitions for algebraic data type specifications

    Sam Kamin

    Article19797 citations
    ABI

  14. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations
    ABI

  15. The number ofQ-congruences in positive algebras

    N. Kh. Kasymov

    Article19925 citations
    ABI

  16. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 citations
    ABI

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

  18. Semirecursive sets and positive reducibility

    Carl G. Jockusch

    Article19684 citations
    ABI

  19. The number of algebras over simple sets

    N. Kh. Kasymov

    Article19924 citations
    ABI

  20. Uniform $m$-equivalencies and numberings of classical systems

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

    Article20223 citations
    ABI

  21. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20242 citations
    ABI