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

8 та иш

Иш: On computable automorphisms of the rational numbers

1. Definability of Linear Orders over Negative Equivalences

   N. Kh. Kasymov, Andrey Morozov

   МақолаComputability, Logic, AI AlgorithmsAlgebra and Logic201611 иқтибос

   ABIABI:AkademIndex/openalex/2026.other.357716

2. Negative Dense Linear Orders

   N. Kh. Kasymov, R. N. Dadazhanov

   МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 иқтибос

   ABIABI:AkademIndex/openalex/2026.other.407933

3. Structures of Degrees of Negative Representations of Linear Orders

   N. Kh. Kasymov, R. N. Dadazhanov, S. K. Djavliev

   МақолаComputability, Logic, AI AlgorithmsRussian Mathematics20215 иқтибос

   ABIABI:AkademIndex/openalex/2021.article.001381

4. Lower Semilattices of Separable Congruences of Numbered Algebras

   N. Kh. Kasymov, Andrey Morozov

   МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 иқтибос

   ABIABI:AkademIndex/openalex/2023.article.001471

5. Computably Separable Models

   N. Kh. Kasymov, F. N. Ibragimov

   МақолаComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 иқтибос

   ABIABI:AkademIndex/openalex/2022.article.001080

6. Separable Algorithmic Representations of Classical Systems and their Applications

   N. Kh. Kasymov, R. N. Dadazhanov, F. N. Ibragimov

   МақолаComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 иқтибос

   ABIABI:AkademIndex/openalex/2024.article.001602

7. Separable Algorithmic Representations of Classical Systems and Their Applications

   N. Kh. Kasymov, R. N. Dadazhanov, F. N. Ibragimov

   МақолаAdvanced Data Processing TechniquesContemporary Mathematics Fundamental Directions20213 иқтибос

   ABIABI:AkademIndex/openalex/2021.article.001331

8. Computably Separable Models

   N. Kh. Kasymov, F. N. Ibragimov

   МақолаComputability, Logic, AI AlgorithmsContemporary Mathematics Fundamental Directions20181 иқтибос

   ABIABI:AkademIndex/openalex/2026.other.391812