Ushbu ishga iqtibos qilgan ishlar

4 ta ish

Ish: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

1. Defining algorithmically presented structures in first order logic

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

   MaqolaComputability, Logic, AI Algorithms20241 iqtibos

   ABIABI:AkademIndex/openalex/2024.article.003555

2. Separable numberings of universal algebras

   N. Kh. Kasymov

   MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.003416

3. One Question of the Theory of Numbered Groups

   N. Kh. Kasymov

   MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20250 iqtibos

   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

   MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.007548