Incomparable prime ideals of recursively enumerable degrees (Q688789): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q247180 |
||
| Property / reviewed by | |||
| Property / reviewed by: Rodney G. Downey / rank | |||
Revision as of 20:04, 11 February 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
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
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
