Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

12 works

Work: Homomorphisms onto negative algebras

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

  2. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 citations
    ABI

  3. Separable Algorithmic Representations of Classical Systems and their Applications

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

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 citations
    ABI

  4. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20204 citations
    ABI

  5. Separable Algorithmic Representations of Classical Systems and Their Applications

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

    ArticleAdvanced Data Processing TechniquesContemporary Mathematics Fundamental Directions20213 citations
    ABI

  6. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20242 citations
    ABI

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

  8. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

    ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20221 citations
    ABI

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

    N. Kh. Kasymov

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

  10. Defining algorithmically presented structures in first order logic

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

    ArticleComputability, Logic, AI Algorithms20241 citations
    ABI

  11. Separable numberings of universal algebras

    N. Kh. Kasymov

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

  12. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics20250 citations
    ABI