Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-26T07:32:07.998Z Has data issue: false hasContentIssue false

A generalisation of productive set

Published online by Cambridge University Press:  12 March 2014

R. Mitchell*
Affiliation:
Bristol College of Science and Technology

Extract

The purpose of the present paper is to introduce a generalisation of the concept of productive set introduced by Post (2) and studied by Dekker (3) and others. Throughout the paper we shall use small Latin letters to denote both non-negative integers (referred to as numbers) and functions (both partial and total) from numbers to numbers. Sets of numbers will be denoted by small Greek letters and classes of such sets by capital Latin letters. ωη is the range of the ηth partial recursive function.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

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.)

References

[1]Mitchell, R., Some properties of non-recursive sets, Ph. D. Thesis, University of Newcastle upon Tyne, May 1962.Google Scholar
[2]Post, E. L., Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc., vol. 50 (1944), pp. 284316.CrossRefGoogle Scholar
[3]Dekker, J., Productive sets, Trans. Amer. Math. Soc., vol. 78 (1955), pp. 129149.CrossRefGoogle Scholar
[4]Myhill, J., Creative sets, Zeit. für Math. Log. und Grund. der Math., vol. 1 (1955), pp. 97108.CrossRefGoogle Scholar