Asosiy kontentga oʻtish
AkademIndex

Mahsulotlar

Ishlab chiquvchilar uchun

AkademBaseEkotizim uchun ochiq API
← Ishga qaytish

Ushbu ishga iqtibos qilgan ishlar

15 ta ish

Ish: Recursively separable enumerated algebras

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201619 iqtibos
    ABI

  2. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    MaqolaComputability, Logic, AI AlgorithmsAlgebra and Logic201611 iqtibos
    ABI

  3. Separable Enumerations of Division Rings and Effective Embeddability of Rings Therein

    N. Kh. Kasymov, F. N. Ibragimov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20198 iqtibos
    ABI

  4. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 iqtibos
    ABI

  5. Structures of Degrees of Negative Representations of Linear Orders

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

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20215 iqtibos
    ABI

  6. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 iqtibos
    ABI

  7. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20242 iqtibos
    ABI

  8. 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
    ABI

  9. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20221 iqtibos
    ABI

  10. Locally finite and finitely approximated unoids over computably separable equivalences

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20241 iqtibos
    ABI

  11. Defining algorithmically presented structures in first order logic

    N. Kh. Kasymov, N. R. Karimova, Bakh Khoussainov

    MaqolaComputability, Logic, AI Algorithms20241 iqtibos
    ABI

  12. Separable numberings of universal algebras

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos
    ABI

  13. Negativity of effectively separable numberings of fields the finite characteristic

    N. Kh. Kasymov, N. R. Karimova, E. A. Khodzhamuratova

    MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos
    ABI

  14. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 iqtibos
    ABI

  15. Finite Logical Specifications of Effectively Separable Data Models

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

    MaqolaStatistical and Computational ModelingRussian Mathematics20250 iqtibos
    ABI