A structural criterion for recursive enumeration without repetition

&
Mathematical Logic Quarterly 10 (8):105-114 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19640100802

Links

PhilArchive



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

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.
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.
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.
Marian Boykan Pour-El and Ian Richards. A computable ordinary differential equation which possesses no computable solution, Annals of mathematical logic, vol. 17 , pp. 61–90. - Marian Boykan Pour-El and Ian Richards. The wave equation with computable initial data such that its unique solution is not computable. Advances in mathematics, vol. 39 , pp. 215–239. [REVIEW]G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
Review: Marian Boykan Pour-El, Ian Richards, A Computable Ordinary Differential Equation with Possesses no Computable Solution; Marian Boykan Pour-El, Ian Richards, The Wave Equation with Computable Initial Data Such that its Unique Solution is not Computable. [REVIEW]G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
Enumeration of Recursive Sets By Turing Machine.E. K. Blum - 1965 - Mathematical Logic Quarterly 11 (3):197-201.
Marian Boykan Pour-El. Independent axiomatization and its relation to the hypersimple set. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 , pp. 449–456. [REVIEW]Lawrence Feiner - 1973 - Journal of Symbolic Logic 38 (4):654-655.
On Recursive Enumeration Without Repetition.A. H. Lachlan - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):209-220.

Analytics

Added to PP
2013-11-24

Downloads
3 (#1,213,485)

6 months
5 (#1,552,255)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references