Асосий контентга ўтиш
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 Logic20217 иқтибос
    ABI

  2. Structures of Degrees of Negative Representations of Linear Orders

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

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

  3. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

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

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

    N. Kh. Kasymov

    МақолаComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20241 иқтибос
    ABI

  5. Separable numberings of universal algebras

    N. Kh. Kasymov

    МақолаComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 иқтибос
    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 Science20250 иқтибос
    ABI

  7. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    МақолаComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 иқтибос
    ABI

  8. Finite Logical Specifications of Effectively Separable Data Models

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

    МақолаStatistical and Computational ModelingRussian Mathematics20250 иқтибос
    ABI