Skip to main content
AkademIndex

Products

For developers

AkademBasesoonOpen API for the ecosystem
Latin
← Back to work

Works cited by this work

25 works

Work: Separable Algorithmic Representations of Classical Systems and their Applications

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

    N. Kh. Kasymov

    Article199413 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. $$\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 nonetherian congruence lattices

    N. Kh. Kasymov

    Article19929 citations
    ABI

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

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

    Article19968 citations
    ABI

  14. On computable automorphisms of the rational numbers

    Andrey Morozov, J. K. Truss

    Article20018 citations
    ABI

  15. LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS

    Ekaterina Fokina, Bakhadyr Khoussainov, Pavel Semukhin +1

    Article20168 citations
    ABI

  16. Existential quantifiers in abstract data types

    Manfred Broy, Walter Dosch, H. Partsch +2

    Chapter19797 citations
    ABI

  17. Some definitions for algebraic data type specifications

    Sam Kamin

    Article19797 citations
    ABI

  18. Hierarchies of Boolean algebras

    Lawrence Feiner

    Article19706 citations
    ABI

  19. Rekursive Algebren mit Kettenbedingungen

    Walter Bäur

    Article19745 citations
    ABI

  20. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20204 citations
    ABI

  21. Nonconstructive negative algebras with finiteness conditions

    N. Kh. Kasymov

    Article19923 citations
    ABI

  22. �ber rekursive Strukturen

    Walte Baur

    Article19743 citations
    ABI

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

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

    Article20213 citations
    ABI

  24. Effective compacts over co-immune sets

    R.N. Dadajonov, N. R. Karimova, N. Kh. Kasymov

    Article20192 citations
    ABI

  25. Untitled

    Other1 citations
    ABI