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 Science2024Цитирований: 1

   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 Science2024Цитирований: 0

   ABIABI:AkademIndex/openalex/2024.article.005746

3. Separable numberings of universal algebras

   N. Kh. Kasymov

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

   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 Science2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.007548