Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

3 works

Work: Uniform $m$-equivalencies and numberings of classical systems

  1. Separable numberings of universal algebras

    N. Kh. Kasymov

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

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

  3. Finite Logical Specifications of Effectively Separable Data Models

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

    ArticleStatistical and Computational ModelingRussian Mathematics20250 citations
    ABI