Асосий контентга ўтиш
AkademIndex

Маҳсулотлар

Ишлаб чиқувчилар учун

AkademBaseЭкотизим учун очиқ API
← Ишга қайтиш

Ушбу ишга иқтибос қилган ишлар

13 та иш

Иш: A characterisation of computable data types by means of a finite equational specification method

  1. Lower Semilattices of Separable Congruences of Numbered Algebras

    N. Kh. Kasymov, Andrey Morozov

    МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20235 иқтибос
    ABI

  2. Computably Separable Models

    N. Kh. Kasymov, F. N. Ibragimov

    МақолаComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20224 иқтибос
    ABI

  3. Separable Algorithmic Representations of Classical Systems and their Applications

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

    МақолаComputability, Logic, AI AlgorithmsJournal of Mathematical Sciences20244 иқтибос
    ABI

  4. Logical Specifications of Effectively Separable Data Models

    N. Kh. Kasymov

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

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

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

    МақолаComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20222 иқтибос
    ABI

  6. Computability and Universal Determinability of Negatively Representable Models

    R. N. Dadazhanov

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

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

    N. Kh. Kasymov

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

  8. Defining algorithmically presented structures in first order logic

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

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

  9. Logical specifications of effectively separable data models

    N. Kh. Kasymov

    МақолаSemantic Web and OntologiesIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20241 иқтибос
    ABI

  10. Separable numberings of universal algebras

    N. Kh. Kasymov

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

  11. Unoids with Finiteness Conditions over Computably Separable Equivalences

    N. Kh. Kasymov

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

  12. Finite logical specifications of effectively separable data models

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

    МақолаComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 иқтибос
    ABI

  13. Finite Logical Specifications of Effectively Separable Data Models

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

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