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

Работ: 3

Работа: $T_1$-separable numberings of subdirectly indecomposable algebras

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

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

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