The Upper Semi-Lattice of Degrees of Recursive Unsolvability

&
Journal of Symbolic Logic 21 (4):407-408 (1956)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268423

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Review: S. C. Kleene, Emil L. Post, The Upper Semi-Lattice of Degrees of Recursive Unsolvability. [REVIEW]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
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.
Martin’s Axiom and embeddings of upper semi-lattices into the Turing degrees.Wang Wei - 2010 - Annals of Pure and Applied Logic 161 (10):1291-1298.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
Minimal Degrees of Unsolvability and the Full Approximation Construction.American Mathematical Society, Donald I. Cartwright, John Williford Duskin & Richard L. Epstein - 1975 - American Mathematical Soc..
Mass Problems and Intuitionism.Stephen G. Simpson - 2008 - Notre Dame Journal of Formal Logic 49 (2):127-136.
Non‐Complementedness and Non‐Distributivity of Kleene Degrees.Hisato Muraki - 1997 - Mathematical Logic Quarterly 43 (3):378-388.
A Note on Closed Degrees of Difficulty of the Medvedev Lattice.Caterina Bianchini & Andrea Sorbi - 1996 - Mathematical Logic Quarterly 42 (1):127-133.
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.
§ 1. Introduction After seeing the Sacks Density Theorem [Sa2], Shoenfield conjectured [Sh2] that the recursively enumerable (re) degrees R form a dense structure as an upper semi-lattice analogously as the rationals are a dense structure as a linearly. [REVIEW]David P. Miller - 1981 - In M. Lerman, J. H. Schmerl & R. I. Soare (eds.), Logic Year 1979-80, the University of Connecticut, Usa. Springer Verlag. pp. 859--230.
Degrees of difficulty of generalized r.e. separating classes.Douglas Cenzer & Peter G. Hinman - 2008 - Archive for Mathematical Logic 46 (7-8):629-647.
On Degrees of Recursive Unsolvability.Clifford Spector - 1957 - Journal of Symbolic Logic 22 (4):374-375.
Review: Emil L. Post, Recursive Unsolvability of a Problem of Thue. [REVIEW]S. C. Kleene - 1947 - Journal of Symbolic Logic 12 (3):90-91.
Local Density of Kleene Degrees.Hisato Muraki - 1995 - Mathematical Logic Quarterly 41 (2):183-189.
Generalized nonsplitting in the recursively enumerable degrees.Steven D. Leonhardi - 1997 - Journal of Symbolic Logic 62 (2):397-437.

Analytics

Added to PP
2015-02-05

Downloads
27 (#572,408)

6 months
5 (#652,053)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The density of the nonbranching degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
Natural factors of the Medvedev lattice capturing IPC.Rutger Kuyper - 2014 - Archive for Mathematical Logic 53 (7-8):865-879.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references