Sets without Subsets of Higher Many-One Degree

Notre Dame Journal of Formal Logic 46 (2):207-216 (2005)
  Copy   BIBTEX

Abstract

Previously, both Soare and Simpson considered sets without subsets of higher -degree. Cintioli and Silvestri, for a reducibility , define the concept of a -introimmune set. For the most common reducibilities , a set does not contain subsets of higher -degree if and only if it is -introimmune. In this paper we consider -introimmune and -introimmune sets and examine how structurally easy such sets can be. In other words we ask, What is the smallest class of the Kleene's Hierarchy containing -introimmune sets for ? We answer the question by proving the existence of -introimmune sets in the class , bi--introimmune sets in , and bi--introimmune sets in

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Low sets without subsets of higher many-one degree.Patrizio Cintioli - 2011 - Mathematical Logic Quarterly 57 (5):517-523.
A note on degrees of subsets.Robert I. Soare - 1969 - Journal of Symbolic Logic 34 (2):256.
Kleene index sets and functional m-degrees.Jeanleah Mohrherr - 1983 - Journal of Symbolic Logic 48 (3):829-840.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Approximate decidability in euclidean spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (1):34-56.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Post's Problem for Reducibilities of Bounded Complexity.Valeriy K. Bulitko - 2002 - Mathematical Logic Quarterly 48 (3):367-373.
Sets which do not have subsets of every higher degree.Stephen G. Simpson - 1978 - Journal of Symbolic Logic 43 (1):135-138.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.

Analytics

Added to PP
2010-08-24

Downloads
12 (#1,094,846)

6 months
5 (#837,836)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Patrizio Cintioli
Università degli Studi di Camerino

Citations of this work

Low sets without subsets of higher many-one degree.Patrizio Cintioli - 2011 - Mathematical Logic Quarterly 57 (5):517-523.

Add more citations

References found in this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Uniformly introreducible sets.Carl G. Jockusch - 1968 - Journal of Symbolic Logic 33 (4):521-536.
Sets with no subset of higher degrees.Robert I. Soare - 1969 - Journal of Symbolic Logic 34 (1):53-56.
Sets which do not have subsets of every higher degree.Stephen G. Simpson - 1978 - Journal of Symbolic Logic 43 (1):135-138.
Recursively Enumerable Sets and Retracting Functions.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (3):394-394.

Add more references