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

Работ: 4

Работа: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

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

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

   N. Kh. Kasymov

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

   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

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

   ABIABI:AkademIndex/openalex/2025.article.007548