Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

16 works

Work: 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

    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. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 citations
    ABI

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

  5. Topological Spaces Over Algorithmic Representations of Universal Algebras

    N. Kh. Kasymov, I. A. Khodzhamuratova

    ArticleComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20204 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. Logical specifications of effectively separable data models

    N. Kh. Kasymov

    ArticleSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20241 citations
    ABI

  11. Separable numberings of universal algebras

    N. Kh. Kasymov

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

  12. One Question of the Theory of Numbered Groups

    N. Kh. Kasymov

    ArticleComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20250 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

    ArticleComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 citations
    ABI

  16. Finite Logical Specifications of Effectively Separable Data Models

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

    ArticleStatistical and Computational ModelingRussian Mathematics20250 citations
    ABI