|
This article is cited in 3 scientific papers (total in 3 papers)
On $sQ$-completeness of recursively enumerable sets
R. Sh. Omanadze Tbilisi Ivane Javakhishvili State University, Ilia Vekua Institute of Applied Mathematics
Abstract:
The concepts of $sQ$-reducibility and $sQ_1$-reducibility are considered, and it is shown that these concepts coincide on the class of recursively enumerable sets. Moreover, a description of $sQ$-complete recursively enumerable sets is presented.
Received: 10.06.1991
Citation:
R. Sh. Omanadze, “On $sQ$-completeness of recursively enumerable sets”, Mat. Zametki, 52:3 (1992), 102–107; Math. Notes, 52:3 (1992), 948–952
Linking options:
https://www.mathnet.ru/eng/mzm4705 https://www.mathnet.ru/eng/mzm/v52/i3/p102
|
Statistics & downloads: |
Abstract page: | 182 | Full-text PDF : | 79 | First page: | 1 |
|