Asosiy kontentga oʻtish
AkademIndex

Mahsulotlar

Ishlab chiquvchilar uchun

AkademBaseEkotizim uchun ochiq API
← Ishga qaytish

Ushbu ishga iqtibos qilgan ishlar

10 ta ish

Ish: Recursively Enumerable Sets and Degrees

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

    N. Kh. Kasymov, F. N. Ibragimov

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

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

    N. Kh. Kasymov

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

  5. Defining algorithmically presented structures in first order logic

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

    MaqolaComputability, Logic, AI Algorithms20241 iqtibos
    ABI

  6. Some properties of classes of minimal numberings of arithmetical set families

    Sh. D. Nodirov, M. Kh. Faĭzrahmanov

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

  7. On infinite direct sums of minimal numberings of functional families

    Sh. D. Nodirov, M. Kh. Faĭzrahmanov, Z. K. Shchedrikova

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

  8. On Infinite Direct Sums of Minimal Numberings of Functional Families

    Sh. D. Nodirov, M. Kh. Faĭzrahmanov, Z. K. Shchedrikova

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20250 iqtibos
    ABI

  9. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 iqtibos
    ABI

  10. Notes on Classes of Minimal Numberings of Arithmetical Set Families

    Sh. D. Nodirov, M. Kh. Faĭzrahmanov

    MaqolaComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 iqtibos
    ABI