On Recursive Enumeration Without Repetition

Mathematical Logic Quarterly 11 (3):209-220 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

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

Similar books and articles

On Recursive Enumeration Without Repetition: A Correction.A. H. Lachlan - 1967 - Mathematical Logic Quarterly 13 (7‐12):99-100.
A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Ritual, routine and regime: repetition in early modern British and European cultures.Lorna Clymer (ed.) - 2006 - Toronto: Published by the University of Toronto Press in association with the UCLA Center for Seventeenth-and Eighteenth-Century Studies and the William Andrews Clark Memorial Library.
Uniform enumeration operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
Enumeration of recursive sets.Yoshindo Suzuki - 1959 - Journal of Symbolic Logic 24 (4):311.
Enumeration of Recursive Sets By Turing Machine.E. K. Blum - 1965 - Mathematical Logic Quarterly 11 (3):197-201.

Analytics

Added to PP
2013-11-24

Downloads
26 (#592,813)

6 months
1 (#1,533,009)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.

Add more citations

References found in this work

No references found.

Add more references