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

Продукты

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

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

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

Работ: 8

Работа: Separable Enumerations of Division Rings and Effective Embeddability of Rings Therein

  1. T1-Separable Numberings of Subdirectly Indecomposable Algebras

    N. Kh. Kasymov, Andrey Morozov, I. A. Khodzhamuratova

    СтатьяComputability, Logic, AI AlgorithmsAlgebra and Logic2021Цитирований: 7
    ABI

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

  3. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

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

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

    N. Kh. Kasymov

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

  5. Separable numberings of universal algebras

    N. Kh. Kasymov

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

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

  7. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

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

  8. Finite Logical Specifications of Effectively Separable Data Models

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

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