Enumerability, Decidability, Computability

(1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,458

External links

  • This entry has no external links. Add one.
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

Enumerability, Decidability, Computability. [REVIEW]J. M. P. - 1966 - Review of Metaphysics 19 (3):588-588.
Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.
Dynamic properties of computably enumerable sets.Robert I. Soare - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--105.
Embeddings into the recursively enumerable degreesi.Nsf Grant Dms92 - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 185.
On isolating re and isolated dr. e. degrees.Steffen Lemppl & Richard A. Shore - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--61.
The Medvedev Lattice of Degrees of Difficulty.Andrea Sorbi - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--289.
On the V3-Theory of the Factor Lattice by the Major Subset Relation.Eberhard Herrmann - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--139.
Yates [1970], who obtained a low minimal degree as a corollary to his con.of Minimal Degrees Below - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 81.
SB Cooper, TA Slaman, and SS Wainer, eds. Computability, Enumerability, Unsolvability: Directions in Recursion Theory.R. Downey - 1997 - Journal of Logic Language and Information 6:107-109.

Analytics

Added to PP
2017-02-15

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Second‐Order Intensional Logic.M. J. Cresswell - 1972 - Mathematical Logic Quarterly 18 (19-20):297-320.
Abstraction in Fitch's Basic Logic.Eric Thomas Updike - 2012 - History and Philosophy of Logic 33 (3):215-243.
Dominof-Sets.David W. Straight - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18):235-249.
The Logic of Calculation.John T. Kearns - 1976 - Mathematical Logic Quarterly 23 (1‐6):45-58.

View all 10 citations / Add more citations

References found in this work

No references found.

Add more references