Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-injective-enumerability-of-recursively-enumerable-classes-of-4s2nNgGAwz
References (12)
-
M.B. Pour-El, W.A. Howard (1964)
A structural criterion for recursive enumeration without repetitionZ. Math. Logik Grundlag. Math., 10
-
M. Kummer (1988)
Numberings of R1 union F -
M. Kummer (1989)
Beiträge zur Theorie der Numerierungen: Eindeutige Numerierungen -
A. Lachlan (1967)
On Recursive Enumeration Without Repetition: A CorrectionMathematical Logic Quarterly, 13
-
A. Lachlan (1966)
Lower Bounds for Pairs of Recursively Enumerable DegreesProceedings of The London Mathematical Society
-
A. Lachlan (1965)
On Recursive Enumeration Without RepetitionMathematical Logic Quarterly, 11
-
A. Lachlan (1965)
On recursive enumeration without repetitionZ. Math. Logik Grundlag. Math, 11
-
(1989)
Numberings of Rl tO F , Computer Science Logic 1988 -
(1971)
On minimal numerations of systems of recursively enumerable sets (abstract) -
A. Lachlan (1967)
On recursive enumeration without repetition: A correctionZ. Math. Logik Grundlag. Math., 13
-
M. Pour-El, W. Howard (1964)
A structural criterion for recursive enumeration without repetitionMathematical Logic Quarterly, 10
-
M. Kummer (1989)
Numberings ofR 1 ⌣F, Computer Science Logic 1988Lecture Notes in Computer Science, 385
- Publisher
- Springer Journals
- Copyright
- Copyright © 1995 by Springer-Verlag
- Subject
- Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/BF01375520
- Publisher site
- See Article on Publisher Site
Abstract
To date the problem of finding a general characterization of injective enumerability of recursively enumerable (r.e) classes of r.e. sets has proved intractable. This paper investigates the problem for r.e. classes of cofinite sets. We state a suitable criterion for r.e. classesC such that there is a boundn∈ω with |ω-A|≤n for allA∈C. On the other hand an example is constructed which shows that Lachlan's condition (F) does not imply injective enumerability for r.e. classes of cofinite sets. We also look at a certain embeddability property and show that it is equivalent with injective enumerability for certain classes of cofinite sets. At the end we present a reformulation of property (F).
Journal
Archive for Mathematical Logic – Springer Journals
Published: Mar 11, 2005