J. C. E. Dekker. Two notes on recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 4 , pp. 495–501 [Book Review]

Journal of Symbolic Logic 20 (1):73-74 (1955)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268087

Links

PhilArchive



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

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

Dekker J. C. E. and Myhill J.. Some theorems on classes of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 89 , pp. 25–59. [REVIEW]Martin Davis - 1962 - Journal of Symbolic Logic 27 (1):84-84.
Review: J. C. E. Dekker, Two Notes on Recursively Enumerable Sets. [REVIEW]Martin Davis - 1955 - Journal of Symbolic Logic 20 (1):73-74.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Two Notes on Recursively Enumerable Sets.J. C. E. Dekker - 1955 - Journal of Symbolic Logic 20 (1):73-74.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Putnam Hillary and Smullyan R. M.. Exact separation of recursively enumerable sets within theories. Proceedings of the American Mathematical Society, vol. 11 , pp. 574–577. [REVIEW]William Hanf - 1960 - Journal of Symbolic Logic 25 (4):362-362.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
Review: J. C. E. Dekker, J. Myhill, Some Theorems on Classes of Recursively Enumerable Sets. [REVIEW]Martin Davis - 1962 - Journal of Symbolic Logic 27 (1):84-84.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Effective Nonrecursiveness.Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (1):45-48.
Rice H. G.. Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society, vol. 74 pp. 358–366. [REVIEW]Rózsa Péter - 1954 - Journal of Symbolic Logic 19 (2):121-122.
Post Emil L.. Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society, vol. 50 , pp. 284–316. [REVIEW]J. C. C. McKinsey - 1945 - Journal of Symbolic Logic 10 (1):18-19.

Analytics

Added to PP
2016-06-30

Downloads
8 (#1,313,626)

6 months
1 (#1,464,097)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references