The extendibility of relatively capping degrees under the weak truth table reducibility (Q1334032)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 640454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The extendibility of relatively capping degrees under the weak truth table reducibility |
scientific article; zbMATH DE number 640454 |
Statements
The extendibility of relatively capping degrees under the weak truth table reducibility (English)
0 references
10 August 1995
0 references
The authors continue to study the now very popular notion of relative extendibility of capping degrees. They prove that for any wtt-degrees \(a\), \(b\), \(d\) such that \(d= a\cap b\), \(a| b\), there exist wtt-degrees \(d_ 1\) and \(d_ 2\), \(d_ 1> a\), \(d_ 2> b\), such that \(d_ 1\cap d_ 2= d\). In the proof, the Sacks coding strategy is used.
0 references
wtt-reducibility
0 references
capping degrees
0 references
wtt-degrees
0 references
Sacks coding
0 references
0.7889147400856018
0 references
0.7698956727981567
0 references
0.7587823867797852
0 references
0.7500006556510925
0 references
