The existence of recursively enumerable minimal truth-tabular degrees
From MaRDI portal
Publication:1246422
DOI10.1007/BF01669003zbMath0378.02020MaRDI QIDQ1246422
Publication date: 1976
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186894
Related Items (3)
Embedding lattices into the wtt-degrees below 0′ ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ The ibT degrees of computably enumerable sets are not dense
Cites Work
This page was built for publication: The existence of recursively enumerable minimal truth-tabular degrees
