Перейти к основному содержанию
AkademIndex

Продукты

Для разработчиков

AkademBaseОткрытый API экосистемы
← Назад к работе

Работы, цитирующие эту работу

Работ: 16

Работа: Enumerated algebras with uniformly recursive-separable classes

  1. Structures of Degrees of Negative Representations of Linear Orders

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

    СтатьяComputability, Logic, AI AlgorithmsRussian Mathematics2021Цитирований: 5
    ABI

  2. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2023Цитирований: 5
    ABI

  3. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2022Цитирований: 4
    ABI

  4. Separable Algorithmic Representations of Classical Systems and their Applications

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

    СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2024Цитирований: 4
    ABI

  5. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    СтатьяComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences2020Цитирований: 4
    ABI

  6. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    СтатьяComputability, Logic, AI AlgorithmsRussian Mathematics2024Цитирований: 2
    ABI

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

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

    СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2022Цитирований: 2
    ABI

  8. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    СтатьяComputability, Logic, AI AlgorithmsRussian Mathematics2022Цитирований: 1
    ABI

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

    N. Kh. Kasymov

    СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2024Цитирований: 1
    ABI

  10. Logical specifications of effectively separable data models

    N. Kh. Kasymov

    СтатьяSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika2024Цитирований: 1
    ABI

  11. Separable numberings of universal algebras

    N. Kh. Kasymov

    СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2025Цитирований: 0
    ABI

  12. One Question of the Theory of Numbered Groups

    N. Kh. Kasymov

    СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2025Цитирований: 0
    ABI

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

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

    СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2025Цитирований: 0
    ABI

  14. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    СтатьяComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics2025Цитирований: 0
    ABI

  15. Finite logical specifications of effectively separable data models

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

    СтатьяComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika2025Цитирований: 0
    ABI

  16. Finite Logical Specifications of Effectively Separable Data Models

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

    СтатьяStatistical and Computational ModelingRussian Mathematics2025Цитирований: 0
    ABI