Incomparable prime ideals of recursively enumerable degrees

Annals of Pure and Applied Logic 63 (1):39-56 (1993)
  Copy   BIBTEX

Abstract

Calhoun, W.C., Incomparable prime ideals of recursively enumerable degrees, Annals of Pure and Applied Logic 63 39–56. We show that there is a countably infinite antichain of prime ideals of recursively enumerable degrees. This solves a generalized form of Post's problem

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(93)90207-t

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944). [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Generalized nonsplitting in the recursively enumerable degrees.Steven D. Leonhardi - 1997 - Journal of Symbolic Logic 62 (2):397-437.
Embedding finite lattices into the ideals of computably enumerable Turing degrees.William C. Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.

Analytics

Added to PP
2014-01-16

Downloads
18 (#855,749)

6 months
3 (#1,037,581)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Parameter definability in the recursively enumerable degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.
Homomorphisms and quotients of degree structures.Burkhard Englert, Manuel Lerman & Kevin Wald - 2003 - Annals of Pure and Applied Logic 123 (1-3):193-233.

Add more citations

References found in this work

A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
Labelling systems and R.E. structures.C. J. Ash - 1990 - Annals of Pure and Applied Logic 47 (2):99-119.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
A metatheorem for constructions by finitely many workers.J. F. Knight - 1990 - Journal of Symbolic Logic 55 (2):787-804.

View all 13 references / Add more references