You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Kleene Index Sets and Functional m-Degrees
The Journal of Symbolic Logic
Vol. 48, No. 3 (Sep., 1983), pp. 829-840
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2273476
Page Count: 12
You can always find the topics here!Topics: Index sets, Degree of unsolvability, Numberings, Recursive functions, Algebra, Health savings accounts, Equivalence relation, Isomorphism, Logical theorems, Goedel numbering
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
A many-one degree is functional if it contains the index set of some class of partial recursive functions but does not contain an index set of a class of r.e. sets. We give a natural embedding of the r.e. m-degrees into the functional degrees of 0'. There are many functional degrees in 0' in the sense that every partial-order can be embedded. By generalizing, we show there are many functional degrees in every complete Turning degree. There is a natural tie between the studies of index sets and partial-many-one reducibility. Every partial-many-one degree contains one or two index sets.
The Journal of Symbolic Logic © 1983 Association for Symbolic Logic