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

Работ: 15

Работа: Recursively separable enumerated algebras

1. Homomorphisms onto effectively separable algebras

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2016.article.000113

2. Definability of Linear Orders over Negative Equivalences

   N. Kh. Kasymov, Andrey Morozov

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

   ABIABI:AkademIndex/openalex/2026.other.357716

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

4. Negative Dense Linear Orders

   N. Kh. Kasymov, R. N. Dadazhanov

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

   ABIABI:AkademIndex/openalex/2026.other.407933

5. Structures of Degrees of Negative Representations of Linear Orders

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

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

   ABIABI:AkademIndex/openalex/2021.article.001381

6. Lower Semilattices of Separable Congruences of Numbered Algebras

   N. Kh. Kasymov, Andrey Morozov

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

   ABIABI:AkademIndex/openalex/2023.article.001471

7. Logical Specifications of Effectively Separable Data Models

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2024.article.003060

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

9. Computability and Universal Determinability of Negatively Representable Models

   R. N. Dadazhanov

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

   ABIABI:AkademIndex/openalex/2022.article.001331

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

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

12. Separable numberings of universal algebras

    N. Kh. Kasymov

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

    ABIABI:AkademIndex/openalex/2025.article.003416

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

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

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

    ABIABI:AkademIndex/openalex/2025.article.007548

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

15. Finite Logical Specifications of Effectively Separable Data Models

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

    СтатьяStatistical and Computational ModelingRussian Mathematics2025Цитирований: 0

    ABIABI:AkademIndex/openalex/2025.article.010841