Asosiy kontentga oʻtish
AkademIndex

Mahsulotlar

Ishlab chiquvchilar uchun

AkademBaseEkotizim uchun ochiq API
← Ishga qaytish

Ushbu ish iqtibos qilgan ishlar

21 ta ish

Ish: Finite Logical Specifications of Effectively Separable Data Models

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201619 iqtibos
    ABI

  2. Enumerated algebras with uniformly recursive-separable classes

    N. Kh. Kasymov

    Maqola199316 iqtibos
    ABI

  3. Recursively separable enumerated algebras

    N. Kh. Kasymov

    Maqola199615 iqtibos
    ABI

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

    J. A. Bergstra, John V. Tucker

    Bob198013 iqtibos
    ABI

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

    N. Kh. Kasymov

    Maqola199313 iqtibos
    ABI

  6. CONSTRUCTIVE ALGEBRAS I

    A. I. Malʹt︠s︡ev

    Maqola196112 iqtibos
    ABI

  7. Positive algebras with nonetherian congruence lattices

    N. Kh. Kasymov

    Maqola19929 iqtibos
    ABI

  8. Sarlavhasiz

    Boshqa9 iqtibos
    ABI

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

    Maqola20229 iqtibos
    ABI

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

    N. Kh. Kasymov, F. N. Ibragimov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20198 iqtibos
    ABI

  11. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    MaqolaComputability, Logic, AI AlgorithmsAlgebra and Logic20217 iqtibos
    ABI

  12. Existential quantifiers in abstract data types

    Manfred Broy, Walter Dosch, H. Partsch +2

    Bob19797 iqtibos
    ABI

  13. Some definitions for algebraic data type specifications

    Sam Kamin

    Maqola19797 iqtibos
    ABI

  14. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 iqtibos
    ABI

  15. The number ofQ-congruences in positive algebras

    N. Kh. Kasymov

    Maqola19925 iqtibos
    ABI

  16. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    MaqolaComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 iqtibos
    ABI

  17. Separable Algorithmic Representations of Classical Systems and their Applications

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

    MaqolaComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 iqtibos
    ABI

  18. Semirecursive sets and positive reducibility

    Carl G. Jockusch

    Maqola19684 iqtibos
    ABI

  19. The number of algebras over simple sets

    N. Kh. Kasymov

    Maqola19924 iqtibos
    ABI

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

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

    Maqola20223 iqtibos
    ABI

  21. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20242 iqtibos
    ABI