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

Работ: 5

Работа: Lower Semilattices of Separable Congruences of Numbered Algebras

1. Locally finite and finitely approximated unoids over computably separable equivalences

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2024.article.003415

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. Unoids with Finiteness Conditions over Computably Separable Equivalences

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.007977

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

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