Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works cited by this work

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

    J. A. Bergstra, John V. Tucker

    Chapter198013 citations
    ABI

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

    N. Kh. Kasymov

    Article199313 citations
    ABI

  5. Untitled

    Other9 citations
    ABI

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

    Article20229 citations
    ABI

  7. Рекурсивно отделимые нумерованные алгебры

    Надим Хабибуллаевич Касымов, Надим Хабибуллаевич Касымов

    Article19968 citations
    ABI

  8. Existential quantifiers in abstract data types

    Manfred Broy, Walter Dosch, H. Partsch +2

    Chapter19797 citations
    ABI

  9. Some definitions for algebraic data type specifications

    Sam Kamin

    Article19797 citations
    ABI

  10. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations
    ABI

  11. The number ofQ-congruences in positive algebras

    N. Kh. Kasymov

    Article19925 citations
    ABI

  12. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 citations
    ABI

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

  14. Semirecursive sets and positive reducibility

    Carl G. Jockusch

    Article19684 citations
    ABI

  15. $T_1$-separable numberings of subdirectly indecomposable algebras

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

    Article20213 citations
    ABI

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

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

    Article20223 citations
    ABI

  17. Logical specifications of effectively separable data models

    N. Kh. Kasymov

    ArticleSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20241 citations
    ABI

  18. Untitled

    Other1 citations
    ABI