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

Работ: 3

Работа: Theory of Recursive Functions and Effective Computability

1. Lower Semilattices of Separable Congruences of Numbered Algebras

   N. Kh. Kasymov, Andrey Morozov

   СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2023Цитирований: 5

   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

   СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2022Цитирований: 2

   ABIABI:AkademIndex/openalex/2026.other.407937

3. Defining algorithmically presented structures in first order logic

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

   СтатьяComputability, Logic, AI Algorithms2024Цитирований: 1

   ABIABI:AkademIndex/openalex/2024.article.003555