Indifferent sets for genericity

Journal of Symbolic Logic 78 (1):113-138 (2013)
  Copy   BIBTEX

Abstract

This paper investigates indifferent sets for comeager classes in Cantor space focusing of the class of all 1-generic sets and the class of all weakly 1-generic sets. Jockusch and Posner showed that there exist 1-generic sets that have indifferent sets [10]. Figueira, Miller and Nies have studied indifferent sets for randomness and other notions [7]. We show that any comeager class in Cantor space contains a comeager class with a universal indifferent set. A forcing construction is used to show that any 1-generic set, or weakly 1-generic set, has an indifferent set. Such an indifferent set can by computed by any set in GL2 which bounds the (weakly) 1-generic. We show by approximation arguments that some, but not all, ∆0 1-generic sets can compute an indifferent set 2 for themselves. We show that all ∆0 weakly 1-generic sets can compute 2 an indifferent set for themselves. Additional results on indifferent sets, including one of Miller, and two of Fitzgerald, are presented.

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

Similar books and articles

Almost weakly 2-generic sets.Stephen A. Fenner - 1994 - Journal of Symbolic Logic 59 (3):868-887.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Introenumerability, Autoreducibility, and Randomness.L. I. Ang - forthcoming - Journal of Symbolic Logic.
A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.

Analytics

Added to PP
2013-01-24

Downloads
59 (#265,367)

6 months
11 (#340,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.

Add more citations

References found in this work

Add more references