A high c.e. degree which is not the join of two minimal degrees

DOI10.2178/JSL/1286198150zbMath1216.03055OpenAlexW2042477876MaRDI QIDQ3066797

Matthew B. Giorgi

Publication date: 12 January 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1286198150

zbMATH Keywords

minimal degreehigh c.e. degree

Mathematics Subject Classification ID

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

Cites Work

• Simple Proofs of Some Theorems on High Degrees of Unsolvability

This page was built for publication: A high c.e. degree which is not the join of two minimal degrees