Borel-piecewise continuous reducibility for uniformization problems
Logic
2019-03-14 v3 Logic in Computer Science
Abstract
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and -piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of -piecewise continuity, and then we utilize this connection to obtain separation results on subclasses of -piecewise continuous reductions for uniformization problems on set-valued functions with compact graphs. This method is also applicable for separating various non-constructive principles in the Weihrauch lattice.
Keywords
Cite
@article{arxiv.1608.03269,
title = {Borel-piecewise continuous reducibility for uniformization problems},
author = {Takayuki Kihara},
journal= {arXiv preprint arXiv:1608.03269},
year = {2019}
}