Closed choice for finite and for convex sets

DOI10.1007/978-3-642-39053-1_34MaRDI QIDQ5326378zbMATH OpenOpenAlexFDO

Authors Stéphane Le Roux, Arno Pauly

Publication date 5 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa37382/Download/0037382-14122017165040.pdf

Mathematics Subject Classification ID

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

Recommendations

• Finite choice, convex choice and finding roots
• Closed choice and a uniform low basis theorem
• Completion of choice
• Choice, hull, continuity and fidelity
• Connected choice and the Brouwer fixed point theorem

Cited in

(12)

• Completion of choice
• Finite choice, convex choice and sorting
• Probabilistic computability and choice
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• Finite choice, convex choice and finding roots
• scientific article; zbMATH DE number 3971626 (Why is no real title available?)
• Choices of Convenient Sets
• Partial choice functions for families of finite sets
• A semi-potential for finite and infinite sequential games (extended abstract)
• A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
• Indivisibility and uniform computational strength

This page was built for publication: Closed choice for finite and for convex sets

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