Finite choice, convex choice and finding roots

DOI10.2168/LMCS-11(4:6)2015zbMath1448.03052arXiv1302.0380OpenAlexW2252992943MaRDI QIDQ3460409

Stéphane Le Roux, Arno Pauly

Publication date: 7 January 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsWeihrauch reducibilityclosed choice

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)

Related Items (12)

Comparing representations for function spaces in computable analysis ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ Notes on overt choice ⋮ How constructive is constructing measures? ⋮ Completion of choice ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ On the algebraic structure of Weihrauch degrees ⋮ Representations of Analytic Functions and Weihrauch Degrees ⋮ The Dyck and the Preiss separation uniformly ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis

This page was built for publication: Finite choice, convex choice and finding roots