Асосий контентга ўтиш
AkademIndex

Маҳсулотлар

Ишлаб чиқувчилар учун

AkademBaseЭкотизим учун очиқ API
← Ишга қайтиш

Ушбу иш иқтибос қилган ишлар

10 та иш

Иш: Separable Algorithmic Representations of Classical Systems and Their Applications

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201619 иқтибос
    ABI

  2. Homomorphisms onto negative algebras

    N. Kh. Kasymov

    Мақола199212 иқтибос
    ABI

  3. On computable automorphisms of the rational numbers

    Andrey Morozov, J. K. Truss

    Мақола20018 иқтибос
    ABI

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

    Ekaterina Fokina, Bakhadyr Khoussainov, Pavel Semukhin +1

    Мақола20168 иқтибос
    ABI

  5. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    МақолаComputability, Logic, AI AlgorithmsAlgebra and Logic20217 иқтибос
    ABI

  6. Existential quantifiers in abstract data types

    Manfred Broy, Walter Dosch, H. Partsch +2

    Боб19797 иқтибос
    ABI

  7. Some definitions for algebraic data type specifications

    Sam Kamin

    Мақола19797 иқтибос
    ABI

  8. Hierarchies of Boolean algebras

    Lawrence Feiner

    Мақола19706 иқтибос
    ABI

  9. Rekursive Algebren mit Kettenbedingungen

    Walter Bäur

    Мақола19745 иқтибос
    ABI

  10. Nonconstructive negative algebras with finiteness conditions

    N. Kh. Kasymov

    Мақола19923 иқтибос
    ABI