Ushbu ishga iqtibos qilgan ishlar

3 ta ish

Ish: Uniform $m$-equivalencies and numberings of classical systems

1. Separable numberings of universal algebras

   N. Kh. Kasymov

   MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.003416

2. Finite logical specifications of effectively separable data models

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

   MaqolaComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.008520

3. Finite Logical Specifications of Effectively Separable Data Models

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

   MaqolaStatistical and Computational ModelingRussian Mathematics20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.010841