Mathematics and Theoretical Computer Science

4 та иш

Журнал · ISSN 2949-3919

1. Locally finite and finitely approximated unoids over computably separable equivalences

   N. Kh. Kasymov

   МақолаComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20241 иқтибос

   ABIABI:AkademIndex/openalex/2024.article.003415

2. Some properties of classes of minimal numberings of arithmetical set families

   Sh. D. Nodirov, M. Kh. Faĭzrahmanov

   МақолаComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20240 иқтибос

   ABIABI:AkademIndex/openalex/2024.article.005746

3. Separable numberings of universal algebras

   N. Kh. Kasymov

   МақолаComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 иқтибос

   ABIABI:AkademIndex/openalex/2025.article.003416

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 Science20250 иқтибос

   ABIABI:AkademIndex/openalex/2025.article.007548