101 citations · 491 across the 53 of their papers we have counts for
Showing 2019 · math.LOShow all
2 papers · 2 filters
math.LO2019★ 3 cited
Convex choice, finite choice and sorting
Takayuki Kihara, Arno Pauly
We study the Weihrauch degrees of closed choice for finite sets, closed choice for convex sets and sorting infinite sequences over finite alphabets. Our main results are: One, that…
math.LO2019★ 1 cited
Overt choice
Matthew de Brecht, Arno Pauly, Matthias Schröder
We introduce and study the notion of overt choice for countably-based spaces and for CoPolish spaces. Overt choice is the task of producing a point in a closed set specified by wha…