Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):209-220 (1965)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories |
No categories specified (categorize this paper) |
| DOI | 10.1002/malq.19650110305 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
No references found.
Citations of this work BETA
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On Injective Enumerability of Recursively Enumerable Classes of Cofinite Sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
Similar books and articles
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 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 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.
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.
Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication.Richard M. Friedberg - 1958 - Journal of Symbolic Logic 23 (3):309-316.
Review: Richard M. Friedberg, Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-166.
Generalizations of Enumeration Reducibility Using Recursive Infinitary Propositional Sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
A Jump Inversion Theorem for the Enumeration Jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
The Jump Operator on the Ω-Enumeration Degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
Splitting Theorems for Speed-Up Related to Order of Enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
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 - 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.
The Limitations of Cupping in the Local Structure of the Enumeration Degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.
Analytics
Added to PP index
2016-02-04
Total views
26 ( #441,285 of 2,518,482 )
Recent downloads (6 months)
1 ( #408,186 of 2,518,482 )
2016-02-04
Total views
26 ( #441,285 of 2,518,482 )
Recent downloads (6 months)
1 ( #408,186 of 2,518,482 )
How can I increase my downloads?
Downloads
