Guessing, mind-changing, and the second ambiguous class
From MaRDI portal
Publication:286700
DOI10.1215/00294527-3443549zbMATH Open1436.03247arXiv1401.1894OpenAlexW2171134241MaRDI QIDQ286700FDOQ286700
Authors: Samuel A. Alexander 
Publication date: 25 May 2016
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Abstract: In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable iff it is in the second ambiguous class (boldface Delta^0_2), iff it is eventually annihilated by a certain remainder. We simplify this remainder and give a new proof of the latter equivalence. We then introduce a notion of guessing with an ordinal limit on how often one can change one's mind. We show that for every ordinal alpha, a guessable set is annihilated by alpha applications of the simplified remainder if and only if it is guessable with fewer than alpha mind changes. We use guessability with fewer than alpha mind changes to give a semi-characterization of the Hausdorff difference hierarchy, and indicate how Wadge's notion of guessability can be generalized to higher-order guessability, providing characterizations for boldface Delta^0_alpha for all successor ordinals alpha>1.
Full work available at URL: https://arxiv.org/abs/1401.1894
Recommendations
Cites Work
- Title not available (Why is that?)
- Borel determinacy
- Definable Boolean combinations of open sets are Boolean combinations of open definable sets
- On Guessing Whether A Sequence Has A Certain Property
- Counting the changes of random \({\Delta}^0_2\) sets
- Combinatorial images of sets of reals and semifilter trichotomy
- Calibrating the complexity of \(\Delta_2^0\) sets via their changes
This page was built for publication: Guessing, mind-changing, and the second ambiguous class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286700)
