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

Работ: 2

Работа: Some effectively infinite classes of enumerations

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

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