Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets

DOI10.1002/MALQ.19910371907zbMATH Open0757.03019OpenAlexW2043141429MaRDI QIDQ3990704

Manuel Lerman

Publication date: 28 June 1992

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19910371907

zbMATH Keywords

minimal degreerecursively inseparable setseffectively inseparable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

Density of recursively inseparable R. E. Sets and universal recrusively inseparability ⋮ An ω-REA set forming a minimal pair with 0 ~ ′ ⋮ The minimum degree of recursively representable choice functions

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Bounded recursively enumerable sets and degrees 👍 👎
• Minimal pairs in initial segments of the recursively enumerable degrees 👍 👎
• On Pairs of Recursively Enumerable Degrees 👍 👎
• Degree theoretical splitting properties of recursively enumerable sets 👍 👎
• On minimal pairs of enumeration degrees 👍 👎
• Strong Minimal Covers for Recursively Enumerable Degrees 👍 👎
• Bounding and nonbounding minimal pairs in the enumeration degrees 👍 👎

This page was built for publication: Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets

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