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

Работ: 11

Работа: Definability of Linear Orders over Negative Equivalences

1. Homomorphisms onto effectively separable algebras

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2016.article.000113

2. Negative Dense Linear Orders

   N. Kh. Kasymov, R. N. Dadazhanov

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

   ABIABI:AkademIndex/openalex/2026.other.407933

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

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

5. Computably Separable Models

   N. Kh. Kasymov, F. N. Ibragimov

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

   ABIABI:AkademIndex/openalex/2022.article.001080

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

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. 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. Negative representability degree structures of linear orders with endomorphisms

    N. Kh. Kasymov, Sarvar Javliyev

    СтатьяAdvanced Algebra and LogicBulletin of National University of Uzbekistan Mathematics and Natural Sciences2021Цитирований: 0

    ABIABI:AkademIndex/openalex/2021.article.012705