Pairs without infimum in the recursively enumerable weak truth table degrees (Q3714068): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2273948 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168011248 / rank
 
Normal rank

Latest revision as of 00:05, 20 March 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
    0 references
    0 references
    1986
    0 references
    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 references