Proof of some theorems on recursively enumerable sets

Notre Dame Journal of Formal Logic 3 (2):65-74 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093957149

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

Addendum to my article: "Proof of some theorems on recursively enumerable sets".Thoralf Skolem - 1963 - Notre Dame Journal of Formal Logic 4 (1):44-47.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Some theorems on r-maximal sets and major subsets of recursively enumerable sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Randomness and Recursive Enumerability.Siam J. Comput - unknown
A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
Decision problem for separated distributive lattices.Yuri Gurevich - 1983 - Journal of Symbolic Logic 48 (1):193-196.

Analytics

Added to PP
2010-08-24

Downloads
18 (#803,961)

6 months
4 (#797,377)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Two (or three) notions of finitism.Mihai Ganea - 2010 - Review of Symbolic Logic 3 (1):119-144.
Hierarchies of Primitive Recursive Functions.Charles Parsons - 1968 - Mathematical Logic Quarterly 14 (21‐24):357-376.
Hierarchies of Primitive Recursive Functions.Charles Parsons - 1968 - Mathematical Logic Quarterly 14 (21-24):357-376.

Add more citations

References found in this work

No references found.

Add more references