Pairs without infimum in the recursively enumerable weak truth table degrees (Q3714068)
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 3941522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pairs without infimum in the recursively enumerable weak truth table degrees |
scientific article; zbMATH DE number 3941522 |
Statements
Pairs without infimum in the recursively enumerable weak truth table degrees (English)
0 references
1986
0 references
degrees of unsolvability
0 references
weak reducibilities
0 references
wtt-reducibility
0 references
recursive bound on the oracle information
0 references
wtt-degree
0 references
initial segments
0 references
lattices
0 references
0.8773214817047119
0 references
0.8773214817047119
0 references
0.85788893699646
0 references
0.8425105214118958
0 references
0.8389860391616821
0 references
