A structural criterion for recursive enumeration without repetition

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (8):105-114 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,953

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. H. Lachlan - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):209-220.
Enumeration of Recursive Sets By Turing Machine.E. K. Blum - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):197-201.
Sugihara's Criterion and Some Structural Parallels Between E→ and S3→.Michael Byrd & Dennis Henry - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (12):187-191.
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.
A Classification of the Recursive Functions.Albert R. Meyer & Dennis M. Ritchie - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (4-6):71-82.
Undecidability and recursive inseparability.Raymond M. Smullyan - 1958 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 4 (7-11):143-147.
Automorphisms and Recursive Structures.R. G. Downey & J. B. Remmel - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (4):339-345.

Analytics

Added to PP
2016-02-04

Downloads
25 (#653,364)

6 months
4 (#862,849)

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