학술논문

On Some Properties of 𝑟-Maximal Sets and 𝑄1–𝑁-Reducibility
Document Type
research-article
Author
Source
Georgian Mathematical JournalGeorgian Mathematical Journal. 9(1):161-166
Subject
Recursively enumerable set
maximal set
𝑟-maximal set
𝑄1–𝑁-reducibility
𝑚-reducibility
Language
English
ISSN
1572-9176
1072-947X
Abstract
It is shown that if 𝑀1, 𝑀2 are 𝑟-maximal sets and 𝑀1 ≡ 𝑄1–𝑁𝑀2, then 𝑀1 ≡ 𝑚𝑀2. In addition, we prove that there exists a simultaneously 𝑄1–𝑁- and 𝑊-complete recursively enumerable set which is not 𝑠𝑄-complete.