Asosiy kontentga oʻtish
AkademIndex

Mahsulotlar

Ishlab chiquvchilar uchun

AkademBaseEkotizim uchun ochiq API
← Ishga qaytish

Ushbu ishga iqtibos qilgan ishlar

8 ta ish

Ish: Рекурсивно отделимые нумерованные алгебры

  1. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    MaqolaComputability, Logic, AI AlgorithmsAlgebra and Logic201611 iqtibos
    ABI

  2. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    MaqolaComputability, Logic, AI AlgorithmsAlgebra and Logic20217 iqtibos
    ABI

  3. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    MaqolaComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 iqtibos
    ABI

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

  5. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    MaqolaComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20204 iqtibos
    ABI

  6. Logical specifications of effectively separable data models

    N. Kh. Kasymov

    MaqolaSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20241 iqtibos
    ABI

  7. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    MaqolaComputability, Logic, AI AlgorithmsContemporary Mathematics Fundamental Directions20181 iqtibos
    ABI

  8. Finite logical specifications of effectively separable data models

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

    MaqolaComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 iqtibos
    ABI