Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem

N. Kh. Kasymov

24 works

Uzbekistan National University, Tashkent, Uzbekistan

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201619 citations
    ABI

  2. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic201611 citations
    ABI

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

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20198 citations
    ABI

  4. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic20217 citations
    ABI

  5. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 citations
    ABI

  6. Structures of Degrees of Negative Representations of Linear Orders

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

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20215 citations
    ABI

  7. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations
    ABI

  8. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 citations
    ABI

  9. Separable Algorithmic Representations of Classical Systems and their Applications

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

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 citations
    ABI

  10. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20204 citations
    ABI

  11. Separable Algorithmic Representations of Classical Systems and Their Applications

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

    ArticleAdvanced Data Processing TechniquesContemporary Mathematics Fundamental Directions20213 citations
    ABI

  12. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20242 citations
    ABI

  13. Uniformly Computably Separable Algebras with Effectively Splittable Families of Negative Congruences

    R. N. Dadazhanov, N. Kh. Kasymov, I. A. Khodzhamuratova

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20222 citations
    ABI

  14. Locally finite and finitely approximated unoids over computably separable equivalences

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20241 citations
    ABI

  15. Defining algorithmically presented structures in first order logic

    N. Kh. Kasymov, N. R. Karimova, Bakh Khoussainov

    ArticleComputability, Logic, AI Algorithms20241 citations
    ABI

  16. Logical specifications of effectively separable data models

    N. Kh. Kasymov

    ArticleSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20241 citations
    ABI

  17. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsContemporary Mathematics Fundamental Directions20181 citations
    ABI

  18. Negative representability degree structures of linear orders with endomorphisms

    N. Kh. Kasymov, Sarvar Javliyev

    ArticleAdvanced Algebra and LogicBulletin of National University of Uzbekistan Mathematics and Natural Sciences20210 citations
    ABI

  19. Separable numberings of universal algebras

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 citations
    ABI

  20. One Question of the Theory of Numbered Groups

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20250 citations
    ABI

  21. Negativity of effectively separable numberings of fields the finite characteristic

    N. Kh. Kasymov, N. R. Karimova, E. A. Khodzhamuratova

    ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 citations
    ABI

  22. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 citations
    ABI

  23. Finite logical specifications of effectively separable data models

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

    ArticleComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 citations
    ABI

  24. Finite Logical Specifications of Effectively Separable Data Models

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

    ArticleStatistical and Computational ModelingRussian Mathematics20250 citations
    ABI