Recursion theory on orderings. II

DOI10.2307/2273192zbMath0471.03036OpenAlexW2129648898MaRDI QIDQ3924185

Jeffery B. Remmel

Publication date: 1980

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273192

zbMATH Keywords

splitting theoremmajor subsetscharacterization of hyperhypersimple setsuniformly maximaluniformly noncomplementeduniformly nonrecursive

Mathematics Subject Classification ID

Model theory (03C99) Theory of numerations, effectively presented structures (03D45)

Related Items

Degrees of recursively enumerable topological spaces, R-maximal Boolean algebras

Cites Work

• Unnamed Item
• Recursion theory on orderings. I. A model theoretic setting
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Recursively enumerable sets of positive integers and their decision problems
• Creative sets