Translator Disclaimer
March 2013 Indifferent sets for genericity
Adam R. Day
J. Symbolic Logic 78(1): 113-138 (March 2013). DOI: 10.2178/jsl.7801080


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 $\overline{\mathbf{GL_2}}$ which bounds the (weakly) 1-generic. We show by approximation arguments that some, but not all, $\Delta^0_2$ 1-generic sets can compute an indifferent set for themselves. We show that all $\Delta^0_2$ weakly 1-generic sets can compute an indifferent set for themselves. Additional results on indifferent sets, including one of Miller, and two of Fitzgerald, are presented.


Download Citation

Adam R. Day. "Indifferent sets for genericity." J. Symbolic Logic 78 (1) 113 - 138, March 2013.


Published: March 2013
First available in Project Euclid: 23 January 2013

zbMATH: 1275.03134
MathSciNet: MR3087065
Digital Object Identifier: 10.2178/jsl.7801080

Rights: Copyright © 2013 Association for Symbolic Logic


This article is only available to subscribers.
It is not available for individual sale.

Vol.78 • No. 1 • March 2013
Back to Top