Two Theorems on Hyperhypersimple Sets

DOI10.2307/1994474MaRDI QIDQ5534208zbMATH OpenOpenAlexFDO

Authors R. W. Robinson

Publication date 1967

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

zbMATH Keywords

mathematical logic

Cites work

• A maximal set which is not complete
• Approximation of functions on the integers
• Linear orderings under one-one reducibility
• On the Lattice of Recursively Enumerable Sets
• Recursively Enumerable Sets and Retracing Functions
• Recursively enumerable sets of positive integers and their decision problems
• Some observations on quasicohesive sets
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Three theorems on the degrees of recursively enumerable sets
• Two Remarks on Indecomposable Number Sets

Cited in

(4)

• Two theorems on recursively enumerable sets
• 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

This page was built for publication: Two Theorems on Hyperhypersimple Sets

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