Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T07:13:44.762Z Has data issue: false hasContentIssue false

Splinters of recursive functions1

Published online by Cambridge University Press:  12 March 2014

J. S. Ullian*
Affiliation:
Johns Hopkins University

Extract

Basic notation in this paper is as in [3]. From [5] and [9] the following additional notation is derived, ϕi is the partial recursive function with index i, Wi its range. ∅ is the empty set. ‘≡’ denotes isomorphism between sets, ‘≡m’ many-one equivalence, ‘≡T’ Turing equivalence, ‘≦1’ and ‘≦m’ signify one-one and many-one reducibility respectively. ‘Recursive’ is used throughout for ‘general recursive’.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1960

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable