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

Маҳсулотлар

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

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

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

24 та иш

Иш: Locally finite and finitely approximated unoids over computably separable equivalences

  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. Algebras over negative equivalences

    N. Kh. Kasymov

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

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

    J. A. Bergstra, John V. Tucker

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

  6. CONSTRUCTIVE ALGEBRAS I

    A. I. Malʹt︠s︡ev

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

  7. Positive algebras with countable congruence lattices

    N. Kh. Kasymov

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

  8. Homomorphisms onto negative algebras

    N. Kh. Kasymov

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

  9. Algebras with finitely approximable positively representable enrichments

    N. Kh. Kasymov

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

  10. Recursively Enumerable Sets and Degrees

    Robert I. Soare

    Китоб198710 иқтибос
    ABI

  11. Positive algebras with congruences of finite index

    N. Kh. Kasymov

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

  12. Positive algebras with nonetherian congruence lattices

    N. Kh. Kasymov

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

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

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

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

    Uri Andrews, DANIEL F. BELIN, Luca San Mauro

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

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

    N. Kh. Kasymov, F. N. Ibragimov

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

  16. Theory of Numberings

    Yuri L. Ershov

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

  17. Structures of Degrees of Negative Representations of Linear Orders

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

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

  18. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

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

  19. Weakly semirecursive sets

    Carl G. Jockusch, James C. Owings

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

  20. On effectively hypersimple sets

    M. M. Arslanov

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

  21. Universal Generalized Computable Numberings and Hyperimmunity

    M. Kh. Faĭzrakhmanov

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

  22. On the general theory of algebraic systems

    A. Mal′cev

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

  23. Algebraic Systems

    A. I. Mal’cev

    Китоб19732 иқтибос
    ABI

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

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