Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

15 works

Work: Recursively separable enumerated algebras

  1. Homomorphisms onto effectively separable algebras

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal201619 citations
    ABI

  2. Definability of Linear Orders over Negative Equivalences

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsAlgebra and Logic201611 citations
    ABI

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

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20198 citations
    ABI

  4. Negative Dense Linear Orders

    N. Kh. Kasymov, R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20176 citations
    ABI

  5. Structures of Degrees of Negative Representations of Linear Orders

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

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20215 citations
    ABI

  6. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations
    ABI

  7. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20242 citations
    ABI

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

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

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20222 citations
    ABI

  9. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20221 citations
    ABI

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

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20241 citations
    ABI

  11. Defining algorithmically presented structures in first order logic

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

    ArticleComputability, Logic, AI Algorithms20241 citations
    ABI

  12. Separable numberings of universal algebras

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 citations
    ABI

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

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

    ArticleComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 citations
    ABI

  14. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 citations
    ABI

  15. Finite Logical Specifications of Effectively Separable Data Models

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

    ArticleStatistical and Computational ModelingRussian Mathematics20250 citations
    ABI