Ushbu ishga iqtibos qilgan ishlar

4 ta ish

Ish: Computably Separable Models

1. Computability and Universal Determinability of Negatively Representable Models

   R. N. Dadazhanov

   MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20223 iqtibos

   ABIABI:AkademIndex/2022.article.001331

2. Separable numberings of universal algebras

   N. Kh. Kasymov

   MaqolaOAOchiq kirishComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos

   ABIABI:AkademIndex/2025.article.003416

3. Finite logical specifications of effectively separable data models

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

   MaqolaOAOchiq kirishComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 iqtibos

   ABIABI:AkademIndex/2025.article.008520

4. 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/2025.article.010841