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

Маҳсулотлар

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

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

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

21 та иш

Иш: Finite Logical Specifications of Effectively Separable Data Models

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

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

  2. Enumerated algebras with uniformly recursive-separable classes

    N. Kh. Kasymov

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

  3. Recursively separable enumerated algebras

    N. Kh. Kasymov

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

  4. A characterisation of computable data types by means of a finite equational specification method

    J. A. Bergstra, John V. Tucker

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

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

    N. Kh. Kasymov

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

  6. CONSTRUCTIVE ALGEBRAS I

    A. I. Malʹt︠s︡ev

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

  7. Positive algebras with nonetherian congruence lattices

    N. Kh. Kasymov

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

  8. Сарлавҳасиз

    Бошқа9 иқтибос
    ABI

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

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

  10. Separable Enumerations of Division Rings and Effective Embeddability of Rings Therein

    N. Kh. Kasymov, F. N. Ibragimov

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

  11. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

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

  12. Existential quantifiers in abstract data types

    Manfred Broy, Walter Dosch, H. Partsch +2

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

  13. Some definitions for algebraic data type specifications

    Sam Kamin

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

  14. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

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

  15. The number ofQ-congruences in positive algebras

    N. Kh. Kasymov

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

  16. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    МақолаComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 иқтибос
    ABI

  17. Separable Algorithmic Representations of Classical Systems and their Applications

    N. Kh. Kasymov, R. N. Dadazhanov, F. N. Ibragimov

    МақолаComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 иқтибос
    ABI

  18. Semirecursive sets and positive reducibility

    Carl G. Jockusch

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

  19. The number of algebras over simple sets

    N. Kh. Kasymov

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

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

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

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

  21. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    МақолаComputability, Logic, AI AlgorithmsRussian Mathematics20242 иқтибос
    ABI