Pairs without infimum in the recursively enumerable weak truth table degrees (Q3714068): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:31, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pairs without infimum in the recursively enumerable weak truth table degrees |
scientific article |
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