Works citing this work

5 works

Work: Lower Semilattices of Separable Congruences of Numbered Algebras

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

   N. Kh. Kasymov

   ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20241 citations

   ABIABI:AkademIndex/openalex/2024.article.003415

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

   N. Kh. Kasymov

   ArticleComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 citations

   ABIABI:AkademIndex/openalex/2025.article.007977

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

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