Low sets without subsets of higher many-one degree

Mathematical Logic Quarterly 57 (5):517-523 (2011)
  Copy   BIBTEX

Abstract

Given a reducibility ⩽r, we say that an infinite set A is r-introimmune if A is not r-reducible to any of its subsets B with |A\B| = ∞. We consider the many-one reducibility ⩽m and we prove the existence of a low1 m-introimmune set in Π01 and the existence of a low1 bi-m-introimmune set

Categories

Keywords

Reprint years

DOI

10.1002/malq.200920043

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

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

Through your library

My notes

Similar books and articles

Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Sets without Subsets of Higher Many-One Degree.Patrizio Cintioli - 2005 - Notre Dame Journal of Formal Logic 46 (2):207-216.
On the bounded quasi‐degrees of c.e. sets.Roland Sh Omanadze - 2013 - Mathematical Logic Quarterly 59 (3):238-246.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
Some theorems on r-maximal sets and major subsets of recursively enumerable sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.
On the structures inside truth-table degrees.Frank Stephan - 2001 - Journal of Symbolic Logic 66 (2):731-770.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.

Analytics

Added to PP
2013-12-01

Downloads
6 (#1,480,458)

6 months
1 (#1,508,411)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Patrizio Cintioli
Università degli Studi di Camerino

Citations of this work

No citations found.

Add more citations

References found in this work

A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.
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.
A note on degrees of subsets.Robert I. Soare - 1969 - Journal of Symbolic Logic 34 (2):256.

View all 7 references / Add more references