Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-05-10T17:27:38.788Z Has data issue: false hasContentIssue false
  • English
  • Français

Linear orderings under one-one reducibility

Published online by Cambridge University Press:  12 March 2014

Paul R. Young
Paul R. Young*
Affiliation:
Reed College and Stanford university
Get access Rights & Permissions [Opens in a new window]

Extract

In [2], Fischer has shown the existence of a bounded-truth-table degree of unsolvability which contains a collection of many-one degrees which has, under many-one reducibility, the order type, ω, of the positive integers. In [1; pg. 124], Dekker and Myhill give a construction which shows that the many-one degree of any simple set contains a collection of one-one degrees of simple sets which has, under one-one reducibility, the order type (ω + ω*) ·ω. A basic result of recursive function theory (due to Myhill) is that the creative sets form a many-one degree which consists of a single one-one degree (i.e. a single recursive isomorphism type).

It is well known that the recursive sets form three many-one degrees. Two of these, the degrees of the empty set and of the set of all integers, consist of single one-one degrees.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 31 , Issue 1 , March 1966 , pp. 70 - 85
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

[I]Dekker, J. C. E. and Myhill, J., Recursive Equivalence Types, University of California Press, Berkeley and Los Angeles, 1960, pp. 67–211.Google Scholar
[2]Fischer, P. C., A note on bounded-truth-table reducibility, Proceedings of the American Mathematical Society, 14 (1963), pp. 875–877.CrossRefGoogle Scholar
[3]Friedberg, R., Three theorems on recursive enumeration, this Journal, 23 (1958), pp. 309–316.Google Scholar
[4]Martin, D. A., A theorem on hyperhypersimple sets, this Journal, 28 (1963), pp. 273–278.Google Scholar
[5]McLaughlin, T. G., Strong reducibility on hypersimple sets, Notre Dame Journal for Formal Logic, to appear.Google Scholar
[6]Myhill, J., Recursive digraphs, splinters and cylinders, Mathematische Annalen, 138 (1959), pp. 211–218.CrossRefGoogle Scholar
[7]Post, E. L., Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, 50 (1944), pp. 284–316.CrossRefGoogle Scholar
[8]Rogers, H. Jr., Recursive Functions and Effective Computability, McGraw-Hill, 1966.Google Scholar
[9]Rose, G. F. and Ullian, J. S., Approximation of functions on the integers, Pacific Journal of Mathematics, 13 (1963), pp. 693–701.CrossRefGoogle Scholar
[10]Shoenfield, J., Quasicreative sets, Proceedings of the American Mathematical Society, 8 (1957), pp. 964–967.CrossRefGoogle Scholar
[11]Young, P. R., On the structure of recursively enumerable sets, Doctoral Dissertation, Massachusetts Institute of Technology, 1963.Google Scholar
[12]Young, P. R., Notes on the structure of r.e. sets, Notices of the American Mathematical Society, 63T–368 (October, 1963), (abstract).Google Scholar
[13]Young, P. R., A note on pseudo-creative sets and cylinders, Pacific Journal of Mathematics, 14 (1964), pp. 749–753.CrossRefGoogle Scholar
[14]Young, P. R., On reducibility by recursive functions, Proceedings of the American Mathematical Society, 15 (1964), pp. 889–892.CrossRefGoogle Scholar
[15]Young, P. R., On semi-cylinders, splinters, and bounded-truth-table reducibility, Transactions of the American Mathematical Society, 115 (1965), pp. 329–339.CrossRefGoogle Scholar