Switch to: Citations

References in:

On self-embeddings of computable linear orderings

Rodney G. Downey, Carl Jockusch & Joseph S. Miller

Annals of Pure and Applied Logic 138 (1):52-76 (2006)

Add references

You must login to add references.

Decomposition and infima in the computably enumerable degrees.Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (2):551-579.details Given two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (a ⋃ c) ⋂ (b ⋃ c), a ⋃ c \| b ⋃ c, and c < a ⋃ b. Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Direct download (9 more) Export citation Bookmark 1 citation
Computability theory and linear orders.Rod Downey - 1998 - In I͡Uriĭ Leonidovich Ershov (ed.), Handbook of Recursive Mathematics. Elsevier. pp. 138--823.details Computability in Philosophy of Computing and Information Export citation Bookmark 13 citations

1