Embedding the diamond in the Σ<sub>2</sub> enumeration degrees (Q3981454): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users 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/2274914 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165579787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal pairs of enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability complementary between recursively enumerable degrees, Part 1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:42, 15 May 2024

scientific article
Language Label Description Also known as
English
Embedding the diamond in the Σ<sub>2</sub> enumeration degrees
scientific article

    Statements

    Embedding the diamond in the Σ<sub>2</sub> enumeration degrees (English)
    0 references
    0 references
    0 references
    26 June 1992
    0 references
    0 references
    low degree
    0 references
    low approximation
    0 references
    diamond lattice
    0 references
    enumeration degrees
    0 references
    Turing degrees
    0 references
    \(e\)-degrees
    0 references
    0 references