Overt choice

DOI10.3233/COM-190253MaRDI QIDQ5131649zbMATH OpenOpenAlexFDO

Authors Matthew De Brecht, Arno Pauly, Matthias Schröder

Publication date 9 November 2020

Published in Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.05926

zbMATH Keywords

computable topologyquasi-Polish spaceWeihrauch reducibility

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30) Constructive and recursive analysis (03F60)

Abstract: 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 what open sets intersect it. We show that the question of whether overt choice is continuous for a given space is related to topological completeness notions such as the Choquet-property; and to whether variants of Michael's selection theorem hold for that space. For spaces where overt choice is discontinuous it is interesting to explore the resulting Weihrauch degrees, which in turn are related to whether or not the space is Frechet-Urysohn.

Recommendations

• Disclosure and choice
• Embedded choices
• Making (non-standard) choices
• Partially dominant choice
• scientific article; zbMATH DE number 4062610
• scientific article; zbMATH DE number 992640

Cited in

(29)

• Enumerating classes of effective quasi-Polish spaces
• Some notes on spaces of ideals and computable topology
• Non-collapse of the effective wadge hierarchy
• Partially dominant choice
• Effective wadge hierarchy in computable quasi-Polish spaces
• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Selectivity properties of spaces
• Effective aspects of Hausdorff and Fourier dimension
• Non-collapse of the effective Wadge hierarchy
• Decision problems for linear recurrences involving arbitrary real numbers
• A syntactic approach to Borel functions: some extensions of Louveau's theorem
• Notes on overt choice
• COMPUTABLY COMPACT METRIC SPACES
• Computing measure as a primitive operation in real number computation
• Descriptive complexity on non-Polish spaces. II
• Computably discrete represented spaces
• Represented spaces of represented spaces
• Effective second countability in computable analysis
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Sequential discontinuity and first-order problems
• Effective bases and notions of effective second countability in computable analysis
• Étale structures and the Joyal-Tierney representation theorem in countable model theory

This page was built for publication: Overt choice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131649)