Two Theorems on Hyperhypersimple Sets
From MaRDI portal
Publication:5534208
DOI10.2307/1994474zbMath0153.31505OpenAlexW4247104071MaRDI QIDQ5534208
Publication date: 1967
Full work available at URL: https://doi.org/10.2307/1994474
Related Items (4)
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets ⋮ Embedding relations in the lattice of recursively enumerable sets ⋮ Recursively enumerable sets and degrees ⋮ Two theorems on recursively enumerable sets
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
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Recursively Enumerable Sets and Retracing Functions
- On the Lattice of Recursively Enumerable Sets
- Linear orderings under one-one reducibility
- Two Remarks on Indecomposable Number Sets
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Two Theorems on Hyperhypersimple Sets
