Incomparable prime ideals of recursively enumerable degrees
From MaRDI portal
Publication:688789
DOI10.1016/0168-0072(93)90207-TzbMath0788.03056MaRDI QIDQ688789
Publication date: 28 November 1993
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Harrington's method of workersinfinite antichain of prime idealsinfinite injury constructionupper-semilattice of recursively enumerable degrees
Related Items (3)
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ Homomorphisms and quotients of degree structures ⋮ Upper bounds on ideals in the computably enumerable Turing degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Undecidability and 1-types in the recursively enumerable degrees
- Labelling systems and r.e. structures
- Constructions by transfinitely many workers
- A non-inversion theorem for the jump operator
- Index sets related to prompt simplicity
- Definability in the enumeration degrees
- The recursively enumerable degrees are dense
- On the degrees less than 0'
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Undecidable and creative theories
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- A metatheorem for constructions by finitely many workers
- The undecidability of the recursively enumerable degrees
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- A recursively enumerable degree which will not split over all lesser ones
- A minimal pair of recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Incomparable prime ideals of recursively enumerable degrees
