Работы, цитирующие эту работу

Работ: 4

Работа: Weakly semirecursive sets

1. Lower Semilattices of Separable Congruences of Numbered Algebras

   N. Kh. Kasymov, Andrey Morozov

   СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2023Цитирований: 5

   ABIABI:AkademIndex/openalex/2023.article.001471

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

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2024Цитирований: 1

   ABIABI:AkademIndex/openalex/2024.article.003415

3. Separable numberings of universal algebras

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.003416

4. Unoids with Finiteness Conditions over Computably Separable Equivalences

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsLobachevskii Journal of Mathematics2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.007977