Some theorems on R-maximal sets and major subsets of recursively enumerable sets
From MaRDI portal
Publication:5652664
DOI10.2307/2270255zbMath0242.02047OpenAlexW2042742137MaRDI QIDQ5652664
Publication date: 1971
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270255
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Recursive equivalence types of sets and structures, isols (03D50)
Related Items
On speedable and levelable vector spaces, Definable relations in Turing degree structures, Computably enumerable sets and related issues, btt-reducibility, \(r\)-maximal major subsets, Recursively enumerable sets and degrees, Automorphisms of the lattice of recursively enumerable sets
Cites Work