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

Маҳсулотлар

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

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

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

22 та иш

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

    N. Kh. Kasymov

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

  7. $$\Pi^0_1$$ -Presentations of Algebras

    Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin

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

  8. Positive algebras with countable congruence lattices

    N. Kh. Kasymov

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

  9. Homomorphisms onto negative algebras

    N. Kh. Kasymov

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

  10. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

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

  11. Algebras with finitely approximable positively representable enrichments

    N. Kh. Kasymov

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

  12. Positive algebras with congruences of finite index

    N. Kh. Kasymov

    Мақола199110 иқтибос
    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. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

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

  16. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 иқтибос
    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. Finitely presented expansions of groups, semigroups, and algebras

    Bakhadyr Khoussainov, Alexei Miasnikov

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

  19. Separable Algorithmic Representations of Classical Systems and Their Applications

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

    МақолаAdvanced Data Processing TechniquesContemporary Mathematics Fundamental Directions20213 иқтибос
    ABI

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

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

  21. Randomness, computability and algebraic specifications

    Bakhadyr Khoussainov

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

  22. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

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