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

Работ: 4

Работа: Semirecursive sets and positive reducibility

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

2. Separable numberings of universal algebras

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2025.article.003416

3. Finite logical specifications of effectively separable data models

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

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

   ABIABI:AkademIndex/openalex/2025.article.008520

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