Definability in the Recursively Enumerable Degrees (Q3128481): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the degrees less than 0' / 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 undecidability of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice nonembeddings and initial segments of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and 1-types in the recursively enumerable degrees / 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: Recursively enumerable sets of positive integers and their decision problems / 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: The impossibility of finding relative complements for recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working below a \(low_ 2\) recursively enumerable degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneity and definability in the first-order theory of the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The homogeneity conjecture / rank
 
Normal rank

Latest revision as of 12:10, 27 May 2024

scientific article
Language Label Description Also known as
English
Definability in the Recursively Enumerable Degrees
scientific article

    Statements

    Definability in the Recursively Enumerable Degrees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 November 1997
    0 references
    0 references
    recursively enumerable degrees
    0 references
    Turing reducibility
    0 references
    double jump
    0 references
    automorphism
    0 references
    definability
    0 references
    0 references