Strong Minimal Covers for Recursively Enumerable Degrees

DOI10.1002/malq.19960420116zbMath0849.03028OpenAlexW2153437969MaRDI QIDQ4879197

S. Barry Cooper

Publication date: 4 November 1996

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

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

zbMATH Keywords

recursively enumerable degreeTuring degreestrong minimal cover

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Intervals containing exactly one c.e. degree

Cites Work

• A 1-generic degree with a strong minimal cover

This page was built for publication: Strong Minimal Covers for Recursively Enumerable Degrees