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

Маҳсулотлар

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

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

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

9 та иш

Иш: Negativity of effectively separable numberings of fields the finite characteristic

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

    N. Kh. Kasymov

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

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

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

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

    N. Kh. Kasymov, F. N. Ibragimov

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

  7. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

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

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

  9. UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

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

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