Asosiy kontentga oʻtish
AkademIndex

Mahsulotlar

Ishlab chiquvchilar uchun

AkademBasetez oradaEkotizim uchun ochiq API
Lotin
← Ishga qaytish

Ushbu ish iqtibos qilgan ishlar

9 ta ish

Ish: Negativity of effectively separable numberings of fields the finite characteristic

  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. Separation axioms and partitions of the set of natural numbers

    N. Kh. Kasymov

    Maqola199313 iqtibos
    ABI

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

    Maqola20229 iqtibos
    ABI

  6. 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

  7. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    MaqolaComputability, Logic, AI AlgorithmsAlgebra and Logic20217 iqtibos
    ABI

  8. 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

  9. UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

    Uri Andrews, Steffen Lempp, Joseph S. Miller +3

    Maqola20144 iqtibos
    ABI