Works citing this work

3 works

Work: Theory of Recursive Functions and Effective Computability

1. Lower Semilattices of Separable Congruences of Numbered Algebras

   N. Kh. Kasymov, Andrey Morozov

   ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations

   ABIABI:AkademIndex/openalex/2023.article.001471

2. Uniformly Computably Separable Algebras with Effectively Splittable Families of Negative Congruences

   R. N. Dadazhanov, N. Kh. Kasymov, I. A. Khodzhamuratova

   ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20222 citations

   ABIABI:AkademIndex/openalex/2026.other.407937

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