Three universal representations of recursively enumerable sets

Journal of Symbolic Logic 43 (2):335-351 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272832

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

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

Verena H. Dyson, James P. Jones, and John C. Shepherdson. Some diophantine forms of Gödel's theorem. Archiv für mathematische Logik und Grundlagenforschung, vol. 22 , pp. 51–60. - James P. Jones. Universal diophantine equation. The journal of symbolic logic, vol. 47 , pp. 549–571. - J. P. Jones and Ju. V. Matijasevič. Exponential diophantine representation of recursively enumerable sets. English with French abstract. Proceedings of the Herbrand Symposium, Logic Colloquium '81, Proceedings of the Herbrand Symposium held in Marseilles, France, July 1981, edited by J. Stern, Studies in logic and the foundations of mathematics, vol. 107, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1982, pp. 159–177. - J. P. Jones and Y. V. Matijasevič. Register machine proof of the theorem on exponential diophantine representation of enumerable sets. The journal of symbolic logic, vol. 49 , pp. 818–829. [REVIEW]Martin Davis - 1986 - Journal of Symbolic Logic 51 (2):477-479.
Simplicity of Recursively Enumerable Sets.Two Theorems on hyperhypersimple Sets.On the Lattice of Recursively Enumerable Sets.The Elementary Theory of Recursively Enumerable Sets.Robert W. Robinson & A. H. Lachlan - 1970 - Journal of Symbolic Logic 35 (1):153-155.
Review: C. E. M. Yates, Three Theorems on the Degrees of Recursively Enumerable Sets. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
Mitotic recursively enumerable sets.Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (2):199-211.
Index sets of finite classes of recursively enumerable sets.Louise Hay - 1969 - Journal of Symbolic Logic 34 (1):39-44.
Nowhere simple sets and the lattice of recursively enumerable sets.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (2):322-330.
Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
Two Notes on Recursively Enumerable Sets.J. C. E. Dekker - 1955 - Journal of Symbolic Logic 20 (1):73-74.
On the indexing of classes of recursively enumerable sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (1):10-22.

Analytics

Added to PP
2009-01-28

Downloads
33 (#125,351)

6 months
8 (#1,326,708)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Scope of Gödel’s First Incompleteness Theorem.Bernd Buldt - 2014 - Logica Universalis 8 (3-4):499-552.

Add more citations

References found in this work

No references found.

Add more references