Asosiy kontentga oʻtish
AkademIndex

Xizmatlar

← Ishga qaytish

Ushbu ishga iqtibos qilgan ishlar

15 ta ish

Ish: Algebras over negative equivalences

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201621 iqtibos
    ABI

  2. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20178 iqtibos
    ABI

  3. 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

  4. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 iqtibos
    ABI

  5. Separable Algorithmic Representations of Classical Systems and their Applications

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

    MaqolaComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 iqtibos
    ABI

  6. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    MaqolaComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20204 iqtibos
    ABI

  7. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20223 iqtibos
    ABI

  8. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsRussian Mathematics20242 iqtibos
    ABI

  9. 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

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

    N. Kh. Kasymov

    MaqolaOchiq kirishComputability, 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. On specifications of positive data models with effectively separable kernels of algorithmic representations

    Nodira R. Karimova

    Maqola20230 iqtibos
    ABI

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

    Nodira R. Karimova

    MaqolaOchiq kirish20230 iqtibos
    ABI

  14. Separable numberings of universal algebras

    N. Kh. Kasymov

    MaqolaOchiq kirishComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos
    ABI

  15. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    MaqolaComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 iqtibos
    ABI