Works citing this work

4 works

Work: Computably Separable Models

1. Computability and Universal Determinability of Negatively Representable Models

   R. N. Dadazhanov

   ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20221 citations

   ABIABI:AkademIndex/openalex/2022.article.001331

2. Separable numberings of universal algebras

   N. Kh. Kasymov

   ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 citations

   ABIABI:AkademIndex/openalex/2025.article.003416

3. Finite logical specifications of effectively separable data models

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

   ArticleComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 citations

   ABIABI:AkademIndex/openalex/2025.article.008520

4. Finite Logical Specifications of Effectively Separable Data Models

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

   ArticleStatistical and Computational ModelingRussian Mathematics20250 citations

   ABIABI:AkademIndex/openalex/2025.article.010841