The density of infima in the recursively enumerable degrees (Q809074): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 12:06, 30 January 2024

scientific article
Language Label Description Also known as
English
The density of infima in the recursively enumerable degrees
scientific article

    Statements

    The density of infima in the recursively enumerable degrees (English)
    0 references
    0 references
    1991
    0 references
    The author shows that, for any recursively enumerable degrees \(\underset{\tilde{}} a\), \(\underset{\tilde{}} e\) with \(\underset{\tilde{}} e<\underset{\tilde{}} a\), there exist incomparable recursively enumerable degrees \(\underset{\tilde{}} b\), \(\underset{\tilde{}} c\) with infimum \(\underset{\tilde{}} d\) such that \(\underset{\tilde{}} e<\underset{\tilde{}} d,\underset{\tilde{}} b,\underset{\tilde{}} c<\underset{\tilde{}} a\). Then, combining \textit{K. Ambos-Spies}' result of ``On pairs of recursively enumerable degrees'' [Trans. Am. Math. Soc. 283, 507-531 (1984; Zbl 0541.03023)], any nontrivial interval in the recursively enumerable degrees contains both incomparable pairs with and without infima in recursively enumerable degrees.
    0 references
    0 references
    recursively enumerable degrees
    0 references
    interval
    0 references
    infima
    0 references