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

Работ: 6

Работа: Theory of Numberings

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

2. Some properties of classes of minimal numberings of arithmetical set families

   Sh. D. Nodirov, M. Kh. Faĭzrahmanov

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

   ABIABI:AkademIndex/openalex/2024.article.005746

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. On Infinite Direct Sums of Minimal Numberings of Functional Families

   Sh. D. Nodirov, M. Kh. Faĭzrahmanov, Z. K. Shchedrikova

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

   ABIABI:AkademIndex/openalex/2025.article.006829

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

6. Notes on Classes of Minimal Numberings of Arithmetical Set Families

   Sh. D. Nodirov, M. Kh. Faĭzrahmanov

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

   ABIABI:AkademIndex/openalex/2025.article.007978