Incomparable prime ideals of recursively enumerable degrees (Q688789): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple 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: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling systems and r.e. structures / 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: The undecidability of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A metatheorem for constructions by finitely many workers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions by transfinitely many workers / 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: Q5670617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursively enumerable degree which will not split over all lesser ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3480023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3232283 / 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: 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: Index sets related to prompt simplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable and creative theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-inversion theorem for the jump operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank

Latest revision as of 11:28, 22 May 2024

scientific article
Language Label Description Also known as
English
Incomparable prime ideals of recursively enumerable degrees
scientific article

    Statements

    Incomparable prime ideals of recursively enumerable degrees (English)
    0 references
    0 references
    28 November 1993
    0 references
    The author establishes that the upper-semilattice \(({\mathbf R},\leq)\) of recursively enumerable degrees contains an infinite antichain of prime ideals. This can be viewed as strong lattice-theoretical strengthening of the Friedberg-Muchnik theorem. The construction is an infinite injury one, but presented roughly, via Harrington's method of workers. The paper begins with a discussion of this method.
    0 references
    0 references
    upper-semilattice of recursively enumerable degrees
    0 references
    infinite injury construction
    0 references
    infinite antichain of prime ideals
    0 references
    Harrington's method of workers
    0 references