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

Работ: 12

Работа: Positive algebras with countable congruence lattices

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

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

3. Computably Separable Models

   N. Kh. Kasymov, F. N. Ibragimov

   СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2022Цитирований: 4

   ABIABI:AkademIndex/openalex/2022.article.001080

4. Separable Algorithmic Representations of Classical Systems and their Applications

   N. Kh. Kasymov, R. N. Dadazhanov, F. N. Ibragimov

   СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2024Цитирований: 4

   ABIABI:AkademIndex/openalex/2024.article.001602

5. Topological Spaces Over Algorithmic Representations of Universal Algebras

   N. Kh. Kasymov, I. A. Khodzhamuratova

   СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2020Цитирований: 4

   ABIABI:AkademIndex/openalex/2026.other.408877

6. Logical Specifications of Effectively Separable Data Models

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2024.article.003060

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

8. Computability and Universal Determinability of Negatively Representable Models

   R. N. Dadazhanov

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

   ABIABI:AkademIndex/openalex/2022.article.001331

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

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

11. Separable numberings of universal algebras

    N. Kh. Kasymov

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

    ABIABI:AkademIndex/openalex/2025.article.003416

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