Ушбу ишга иқтибос қилган ишлар

3 та иш

Иш: Uniform $m$-equivalencies and numberings of classical systems

1. Separable numberings of universal algebras

   N. Kh. Kasymov

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

   ABIABI:AkademIndex/openalex/2025.article.003416

2. Finite logical specifications of effectively separable data models

   N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev

   МақолаComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 иқтибос

   ABIABI:AkademIndex/openalex/2025.article.008520

3. Finite Logical Specifications of Effectively Separable Data Models

   N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev

   МақолаStatistical and Computational ModelingRussian Mathematics20250 иқтибос

   ABIABI:AkademIndex/openalex/2025.article.010841