Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-12-03T20:45:27.395Z Has data issue: false hasContentIssue false

Counterexamples in the Theory of ω-functions

Published online by Cambridge University Press:  20 November 2018

C. H. Applebaum*
Affiliation:
Bowling Green State University, Bowling Green, Ohio
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let ϵ stand for the set of nonnegative integers (numbers), V for the class of all subcollections of ϵ (sets), Λ for the set of isols, and ΛR for the set of regressive isols. A function, f, is a mapping from a subset of ϵ into ϵ and δf and ρf denote the domain and range of f respectively. The relation of inclusion is denoted by ⊂ and that of proper inclusion by ⊊. The sets α and β are recursively equivalent (written αβ), if δf = α and ρf = β for some function f with a one-to-one partial recursive extension.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974

References

1. Applebaum, C. H., ω-homomorphisms and ω-groups, J. Symbolic Logic 86 (1971), 5565.Google Scholar
2. Applebaum, C. H. and J. C. E. Dekker, Partial recursive functions and ω-functions, J. Symbolic Logic 35 (1970), 559568.Google Scholar
3. Barback, J., Two notes on regressive isols, Pacific J. Math. 16 (1966), 407420.Google Scholar
4. Dekker, J. C. E., Infinite series of isols, Proceedings of the Symposium on Recursive Function Theory (Amer. Math. Soc, Providence, 1962), 77-96.Google Scholar
5. Dekker, J. C. E., The minimum of two regressive isols, Math. Z. 83 (1964), 345366.Google Scholar
6. Dekker, J. C. E. and Myhill, J., Recursive equivalence types, Univ. of Calif. Publ. of Math. (N.S.) 3 (1960), 67214.Google Scholar
7. Gonshor, H., The category of recursive functions, Fund. Math. 75 (1972), 8794.Google Scholar
8. Hassett, M. J., Recursive equivalence types and groups, J. Symbolic Logic 34 (1969), 1320.Google Scholar