Works citing this work

4 works

Work: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

1. Defining algorithmically presented structures in first order logic

   N. Kh. Kasymov, N. R. Karimova, Bakh Khoussainov

   ArticleComputability, Logic, AI Algorithms20241 citations

   ABIABI:AkademIndex/openalex/2024.article.003555

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. One Question of the Theory of Numbered Groups

   N. Kh. Kasymov

   ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20250 citations

   ABIABI:AkademIndex/openalex/2025.article.004198

4. Negativity of effectively separable numberings of fields the finite characteristic

   N. Kh. Kasymov, N. R. Karimova, E. A. Khodzhamuratova

   ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 citations

   ABIABI:AkademIndex/openalex/2025.article.007548