Simplicity of recursively enumerable sets

DOI10.2307/2271653MaRDI QIDQ5602100zbMATH OpenOpenAlexFDO

Authors R. W. Robinson

Publication date 1967

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

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

Cites work

• A maximal set which is not complete
• Approximation of functions on the integers
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Recursively Enumerable Sets and Retracing Functions
• Recursively enumerable sets of positive integers and their decision problems
• Some observations on quasicohesive sets
• Three theorems on the degrees of recursively enumerable sets

Cited in

(10)

• m-powers of simple sets
• Atomless r-maximal sets
• Small \(\Pi^{0}_{1}\) classes
• Two theorems on recursively enumerable sets
• Closed left-r.e. sets
• Closed left-r.e. sets
• Recursively enumerable sets and degrees
• Constructivity conditions on immune sets
• Computably enumerable sets and related issues
• A note on r-maximal subspaces of \(V_{\infty}\)

This page was built for publication: Simplicity of recursively enumerable sets

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