Infima in the d.r.e. degrees (Q685080): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Degrees of unsolvability complementary between recursively enumerable degrees, Part 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of the low\(_ 2\) \(n\)-r.e. degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The d.r.e. degrees are not dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak density and cupping in the d-r.e. degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Degrees above low Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of the nonbranching degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every finite lattice is embeddable in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Pairs of Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit on relative genericity in the recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trial and error predicates and the solution to a problem of Mostowski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation and embedding in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Enumerability and the Jump Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of infima in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity, speedable and levelable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank

Latest revision as of 10:28, 22 May 2024

scientific article
Language Label Description Also known as
English
Infima in the d.r.e. degrees
scientific article

    Statements

    Infima in the d.r.e. degrees (English)
    0 references
    0 references
    22 September 1993
    0 references
    The reviewed paper is a selection from the author's Ph.D. thesis and is devoted to the study of n-r.e. set degrees. Several important properties of the infima operation on such degrees are obtained. For example, the branching of every low r.e. degree in \(D_ n\) for \(n\geq 2\) is proved. The same does not hold for \(\text{low}_ 2\) r.e. degrees. As a corollary to the first theorem, the embedding of the finite lattice \(S_ 8\) is obtained. This gives an additional example of the property distinguishing the elementary theories of \(D_ 1\) and \(D_ 2\).
    0 references
    0 references
    d.r.e. set
    0 references
    Turing degree
    0 references
    embedding of finite lattice \(S_ 8\)
    0 references
    infima
    0 references
    branching
    0 references
    0 references