Incomparable prime ideals of recursively enumerable degrees

DOI10.1016/0168-0072(93)90207-TMaRDI QIDQ688789zbMATH OpenFDO

Authors William C. Calhoun

Publication date 28 November 1993

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(93)90207-T

zbMATH Keywords

Harrington's method of workersinfinite antichain of prime idealsinfinite injury constructionupper-semilattice of recursively enumerable degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Review text

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.

Recommendations

• Upper bounds on ideals in the computably enumerable Turing degrees
• On Pairs of Recursively Enumerable Degrees
• On distributivity of the upper semilattices of the degrees below 0'
• The density of infima in the recursively enumerable degrees
• scientific article; zbMATH DE number 4057497

Cites work

• A metatheorem for constructions by finitely many workers
• A minimal pair of recursively enumerable degrees
• A non-inversion theorem for the jump operator
• A recursively enumerable degree which will not split over all lesser ones
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Constructions by transfinitely many workers
• Definability in the enumeration degrees
• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 4150132 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3304986 (Why is no real title available?)
• scientific article; zbMATH DE number 3404227 (Why is no real title available?)
• Index sets related to prompt simplicity
• Labelling systems and r.e. structures
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• On the degrees less than 0'
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Recursively enumerable sets of positive integers and their decision problems
• The recursively enumerable degrees are dense
• The undecidability of the recursively enumerable degrees
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Undecidability and 1-types in the recursively enumerable degrees
• Undecidable and creative theories

Cited in

(4)

• Homomorphisms and quotients of degree structures
• R.e. Prime powers and total rigidity
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• Upper bounds on ideals in the computably enumerable Turing degrees

This page was built for publication: Incomparable prime ideals of recursively enumerable degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688789)