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

Работ: 3

Работа: Separable Algorithmic Representations of Classical Systems and Their Applications

1. Logical Specifications of Effectively Separable Data Models

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2024.article.003060

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

3. Logical specifications of effectively separable data models

   N. Kh. Kasymov

   СтатьяSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika2024Цитирований: 1

   ABIABI:AkademIndex/openalex/2024.article.003566