Completion of choice

DOI10.1016/j.apal.2020.102914zbMath1462.03019arXiv1910.13186MaRDI QIDQ2220486

Vasco Brattka, Guido Gherardi

Publication date: 25 January 2021

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

completion; choice problems; computable analysis; Weihrauch reducibility; totalization; Weihrauch lattice; computable reducibility; classes of computable problems; total Weihrauch reducibility; Weihrauch complexity

Mathematics Subject Classification ID

03F60: Constructive and recursive analysis

03B30: Foundations of classical theories (including reverse mathematics)

03F35: Second- and higher-order arithmetic and fragments

03D30: Other degrees and reducibilities in computability and recursion theory

03D78: Computation over the reals, computable analysis