Ushbu ishga iqtibos qilgan ishlar

6 ta ish

Ish: Separable Algorithmic Representations of Classical Systems and Their Applications

1. Logical Specifications of Effectively Separable Data Models

   N. Kh. Kasymov

   MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20242 iqtibos

   ABIABI:AkademIndex/2024.article.003060

2. Uniformly Computably Separable Algebras with Effectively Splittable Families of Negative Congruences

   R. N. Dadazhanov, N. Kh. Kasymov, I. A. Khodzhamuratova

   MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20222 iqtibos

   ABIABI:AkademIndex/2026.other.407937

3. Logical specifications of effectively separable data models

   N. Kh. Kasymov

   MaqolaOAOchiq kirishSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20241 iqtibos

   ABIABI:AkademIndex/2024.article.003566

4. Algorithmic criterion of locally finite separability of algebras represented over equivalence α<sup>2</sup> ∪ id ω

   Sarvar Zhavliev

   MaqolaOAOchiq kirish20220 iqtibos

   ABIABI:AkademIndex/2022.article.019131

5. On specifications of positive data models with effectively separable kernels of algorithmic representations

   Nodira R. Karimova

   Maqola20230 iqtibos

   ABIABI:AkademIndex/2023.article.025352

6. On specifications of positive data models with effectively separable kernels of algorithmic representations

   Nodira R. Karimova

   MaqolaOAOchiq kirish20230 iqtibos

   ABIABI:AkademIndex/2023.article.025610