On Recursive Enumeration Without Repetition

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):209-220 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19650110305

Links

PhilArchive



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

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

A structural criterion for recursive enumeration without repetition.Marian Boykan Pour-El & William A. Howard - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (8):105-114.
On Recursive Enumeration Without Repetition.A. H. Lachlan - 1965 - Mathematical Logic Quarterly 11 (3):209-220.
On Recursive Enumeration Without Repetition: A Correction.A. H. Lachlan - 1967 - Mathematical Logic Quarterly 13 (7-12):99-100.
On Recursive Enumeration Without Repetition: A Correction.A. H. Lachlan - 1967 - Mathematical Logic Quarterly 13 (7‐12):99-100.
A structural criterion for recursive enumeration without repetition.Marian Boykan Pour-El & William A. Howard - 1964 - Mathematical Logic Quarterly 10 (8):105-114.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
Enumeration of Recursive Sets By Turing Machine.E. K. Blum - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):197-201.
Lachlan A. H.. The U-quantifier. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 171–174. [REVIEW]J. R. Shoenfield - 1962 - Journal of Symbolic Logic 27 (2):244-244.
Lachlan A. H.. Some notions of reducibility and productiveness. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 17–44. [REVIEW]Carl G. Jockusch - 1970 - Journal of Symbolic Logic 35 (3):478-478.
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.

Analytics

Added to PP
2016-02-04

Downloads
33 (#471,604)

6 months
6 (#701,066)

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