Работы, цитирующие эту работу

Работ: 10

Работа: Recursively Enumerable Sets and Degrees

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

   N. Kh. Kasymov, F. N. Ibragimov

   СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2019Цитирований: 8

   ABIABI:AkademIndex/openalex/2019.article.000275

2. T1-Separable Numberings of Subdirectly Indecomposable Algebras

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

   СтатьяComputability, Logic, AI AlgorithmsAlgebra and Logic2021Цитирований: 7

   ABIABI:AkademIndex/openalex/2021.article.000775

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

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

   СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2022Цитирований: 2

   ABIABI:AkademIndex/openalex/2026.other.407937

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

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2024Цитирований: 1

   ABIABI:AkademIndex/openalex/2024.article.003415

5. Defining algorithmically presented structures in first order logic

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

   СтатьяComputability, Logic, AI Algorithms2024Цитирований: 1

   ABIABI:AkademIndex/openalex/2024.article.003555

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

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

   СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2024Цитирований: 0

   ABIABI:AkademIndex/openalex/2024.article.005746

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

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

   СтатьяComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.004988

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

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

   СтатьяComputability, Logic, AI AlgorithmsRussian Mathematics2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.006829

9. Unoids with Finiteness Conditions over Computably Separable Equivalences

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.007977

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

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

    СтатьяComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics2025Цитирований: 0

    ABIABI:AkademIndex/openalex/2025.article.007978