On Recursive Enumeration Without Repetition

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

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Lachlan, A. H. (1965) "On Recursive Enumeration Without Repetition". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11(3):209-220

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,326

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.
Enumeration of Recursive Sets By Turing Machine.E. K. Blum - 1965 - Mathematical Logic Quarterly 11 (3):197-201.
Review: A. H. Lachlan, Recursive Real Numbers. [REVIEW]Paul Axt - 1965 - Journal of Symbolic Logic 30 (2):256-256.

Analytics

Added to PP
2013-11-24

Downloads
33 (#549,248)

6 months
7 (#965,322)

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