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

Работ: 4

Работа: Computably Separable Models

1. Computability and Universal Determinability of Negatively Representable Models

   R. N. Dadazhanov

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

   ABIABI:AkademIndex/openalex/2022.article.001331

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