Some theorems on R-maximal sets and major subsets of recursively enumerable sets

DOI10.2307/2270255zbMATH Open0242.02047OpenAlexW2042742137MaRDI QIDQ5652664FDOQ5652664

Authors: Manuel Lerman 

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

Mathematics Subject Classification ID

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)

Cites Work

• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of Unsolvability. (AM-55)
• Turing degrees and many-one degrees of maximal sets

Cited In (7)

• Computably enumerable sets and related issues
• Definable relations in Turing degree structures
• On speedable and levelable vector spaces
• Automorphisms of the lattice of recursively enumerable sets
• Recursively enumerable sets and degrees
• btt-reducibility
• \(r\)-maximal major subsets

This page was built for publication: Some theorems on R-maximal sets and major subsets of recursively enumerable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652664)