Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

10 works

Work: Recursively Enumerable Sets and Degrees

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

  2. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic20217 citations
    ABI

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

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

    N. Kh. Kasymov

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

  5. Defining algorithmically presented structures in first order logic

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

    ArticleComputability, Logic, AI Algorithms20241 citations
    ABI

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

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

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

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

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

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

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

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

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20250 citations
    ABI

  9. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 citations
    ABI

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

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

    ArticleComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 citations
    ABI