Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works cited by this work

10 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. Homomorphisms onto negative algebras

    N. Kh. Kasymov

    Article199212 citations
    ABI

  3. On computable automorphisms of the rational numbers

    Andrey Morozov, J. K. Truss

    Article20018 citations
    ABI

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

    Ekaterina Fokina, Bakhadyr Khoussainov, Pavel Semukhin +1

    Article20168 citations
    ABI

  5. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic20217 citations
    ABI

  6. Existential quantifiers in abstract data types

    Manfred Broy, Walter Dosch, H. Partsch +2

    Chapter19797 citations
    ABI

  7. Some definitions for algebraic data type specifications

    Sam Kamin

    Article19797 citations
    ABI

  8. Hierarchies of Boolean algebras

    Lawrence Feiner

    Article19706 citations
    ABI

  9. Rekursive Algebren mit Kettenbedingungen

    Walter Bäur

    Article19745 citations
    ABI

  10. Nonconstructive negative algebras with finiteness conditions

    N. Kh. Kasymov

    Article19923 citations
    ABI