Guessing, Mind-Changing, and the Second Ambiguous Class

Notre Dame Journal of Formal Logic 57 (2):209-220 (2016)
  Copy   BIBTEX

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 if and only if it is in the second ambiguous class, if and only if 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 of ${\mathbf{\Delta}}^{0}_{\alpha}$ for all successor ordinals $\alpha\gt 1$

Author's Profile

Samuel Allen Alexander
Ohio State University (PhD)

Analytics

Added to PP
2014-01-12

Downloads
450 (#33,515)

6 months
76 (#50,516)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?