Infima in the recursively enumerable weak truth table degrees

DOI10.1305/ndjfl/1039700747zbMath0909.03038OpenAlexW1977420633MaRDI QIDQ1130238

Steffen Lempp, Rich Blaylock, Rodney G. Downey

Publication date: 8 April 1999

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1039700747

zbMATH Keywords

infimumrecursively enumerable degreesweak truth table degrees

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• On Pairs of Recursively Enumerable Degrees
• Wtt-degrees and T-degrees of r.e. sets
• Pairs without infimum in the recursively enumerable weak truth table degrees
• Cupping and noncapping in the r.e. weak truth table and turing degrees
• Reducibility and Completeness for Sets of Integers
• The weak truth table degrees of recursively enumerable sets
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees