Infimum properties differ in the weak truth-table degrees and the Turing degrees (Q1888712)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Infimum properties differ in the weak truth-table degrees and the Turing degrees |
scientific article; zbMATH DE number 2119281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infimum properties differ in the weak truth-table degrees and the Turing degrees |
scientific article; zbMATH DE number 2119281 |
Statements
Infimum properties differ in the weak truth-table degrees and the Turing degrees (English)
0 references
26 November 2004
0 references
The main result of this paper is the following Theorem. There are two non-recursive r.e. sets \(A\) and \(C\) with \(A<_{T} C\) such that for every set \(F\leq_{T} A\), \(C \cap F \equiv_{W} \emptyset\).
0 references
minimal pair
0 references
wtt-degree
0 references
T-degree
0 references
r.e. set
0 references
