A DNC function that computes no effectively bi-immune set

Archive for Mathematical Logic 54 (5-6):521-530 (2015)
  Copy   BIBTEX

Abstract

Jockusch and Lewis proved that every DNC function computes a bi-immune set. They asked whether every DNC function computes an effectively bi-immune set. We construct a DNC function that computes no effectively bi-immune set, thereby answering their question in the negative.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-015-0425-z

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

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

On diagonal functions for equivalence relations.Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev & Manat Mustafa - 2023 - Archive for Mathematical Logic 63 (3):259-278.
On BI‐Immune Isols.Joachim Biskup - 1976 - Mathematical Logic Quarterly 23 (31‐35):469-484.
On BI‐Immune Isols.Joachim Biskup - 1977 - Mathematical Logic Quarterly 23 (31-35):469-484.
The degrees of bi‐immune sets.Carl G. Jockusch - 1969 - Mathematical Logic Quarterly 15 (7‐12):135-140.
Upward Closure of bi‐Immune Degrees.Carl G. Jockusch - 1972 - Mathematical Logic Quarterly 18 (16‐18):285-287.
A random set which only computes strongly jump-traceable C.e. Sets.Noam Greenberg - 2011 - Journal of Symbolic Logic 76 (2):700 - 718.
Bi-interpretation in weak set theories.Alfredo Roque Freire & Joel David Hamkins - 2021 - Journal of Symbolic Logic 86 (2):609-634.
Degree spectra and immunity properties.Barbara F. Csima & Iskander S. Kalimullin - 2010 - Mathematical Logic Quarterly 56 (1):67-77.
Totally non‐immune sets.Athanassios Tzouvaras - 2015 - Mathematical Logic Quarterly 61 (1-2):103-116.
Bounded Immunity and Btt‐Reductions.Stephen Fenner & Marcus Schaefer - 1999 - Mathematical Logic Quarterly 45 (1):3-21.

Analytics

Added to PP
2015-03-20

Downloads
22 (#698,738)

6 months
12 (#305,852)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Forcing with bushy trees.Mushfeq Khan & Joseph S. Miller - 2017 - Bulletin of Symbolic Logic 23 (2):160-180.

Add more citations

References found in this work

Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Comparing DNR and WWKL.Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp & Theodore A. Slaman - 2004 - Journal of Symbolic Logic 69 (4):1089-1104.

View all 7 references / Add more references