The Brouwer Fixed Point Theorem Revisited

DOI10.1007/978-3-319-40189-8_6zbMath1476.03064OpenAlexW2491196189MaRDI QIDQ3188240

Stéphane Le Roux, Vasco Brattka, Arno Pauly, Joseph S. Miller

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa36017/Download/0036017-12122017162322.pdf

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 (3)

On the algebraic structure of Weihrauch degrees ⋮ Connected choice and the Brouwer fixed point theorem ⋮ On the computability of the set of automorphisms of the unit square

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Fixed point theory in weak second-order arithmetic
• How incomputable is the separable Hahn-Banach theorem?
• On the Computational Content of the Brouwer Fixed Point Theorem
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• Computability of the Radon-Nikodym Derivative
• Weihrauch Degrees of Finding Equilibria in Sequential Games
• Finite choice, convex choice and finding roots
• Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
• Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes
• The degree structure of Weihrauch-reducibility
• On the topological aspects of the theory of represented spaces

This page was built for publication: The Brouwer Fixed Point Theorem Revisited