Simplicity of recursively enumerable sets
From MaRDI portal
Publication:5602100
DOI10.2307/2271653zbMath0204.01203OpenAlexW2097898753MaRDI QIDQ5602100
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
Related Items
Closed left-r.e. sets ⋮ Atomless \(r\)-maximal sets ⋮ Closed Left-R.E. Sets ⋮ Computably enumerable sets and related issues ⋮ Small \(\Pi^{0}_{1}\) classes ⋮ Recursively enumerable sets and degrees ⋮ Two theorems on recursively enumerable sets ⋮ m-powers of simple sets ⋮ A note on r-maximal subspaces of \(V_{\infty}\)
Cites Work
- Approximation of functions on the integers
- Three theorems on the degrees of recursively enumerable sets
- A maximal set which is not complete
- Some observations on quasicohesive sets
- Recursively Enumerable Sets and Retracing Functions
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Simplicity of recursively enumerable sets
