Asosiy kontentga oʻtish
AkademIndex

Mahsulotlar

Ishlab chiquvchilar uchun

AkademBaseEkotizim uchun ochiq API
← Ishga qaytish

Ushbu ishga iqtibos qilgan ishlar

16 ta ish

Ish: Enumerated algebras with uniformly recursive-separable classes

  1. Structures of Degrees of Negative Representations of Linear Orders

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

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20215 iqtibos
    ABI

  2. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 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

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20242 iqtibos
    ABI

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

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

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20222 iqtibos
    ABI

  8. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20221 iqtibos
    ABI

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

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20241 iqtibos
    ABI

  10. Logical specifications of effectively separable data models

    N. Kh. Kasymov

    MaqolaSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20241 iqtibos
    ABI

  11. Separable numberings of universal algebras

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos
    ABI

  12. One Question of the Theory of Numbered Groups

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20250 iqtibos
    ABI

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

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

    MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos
    ABI

  14. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 iqtibos
    ABI

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

  16. Finite Logical Specifications of Effectively Separable Data Models

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

    MaqolaStatistical and Computational ModelingRussian Mathematics20250 iqtibos
    ABI