Connected choice and the Brouwer fixed point theorem
From MaRDI portal
Publication:5223123
DOI10.1142/S0219061319500041zbMath1484.03130arXiv1206.4809OpenAlexW1502819508WikidataQ128896781 ScholiaQ128896781MaRDI QIDQ5223123
Arno Pauly, Joseph S. Miller, Vasco Brattka, Stéphane Le Roux
Publication date: 8 July 2019
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.4809
fixed point theoremsreverse mathematicscomputable analysisconnected setsWeihrauch latticechoice principles
Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)
Related Items
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable ⋮ Separating notions in effective topology ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Completion of choice ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ On the computability of the set of automorphisms of the unit square ⋮ Parallelizations in Weihrauch reducibility and constructive reverse mathematics ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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?
- Countable thin \(\Pi^0_1\) classes
- Computable invariance
- Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- An effective Riemann Mapping Theorem
- Non-computability of competitive equilibrium
- Computational homology
- Computability on subsets of metric spaces.
- On the uniform computational content of the Baire category theorem
- On the uniform computational content of computability theory
- The Vitali Covering Theorem in the Weihrauch Lattice
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- Computability of the Radon-Nikodym Derivative
- Effective Borel measurability and reducibility of functions
- The Brouwer Fixed Point Theorem Revisited
- Finite choice, convex choice and finding roots
- Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
- Singular coverings and non‐uniform notions of closed set computability
- Borel Complexity of Topological Operations on Computable Metric Spaces
- Plottable Real Number Functions and the Computable Graph Theorem
- Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes
- Incomputability of Simply Connected Planar Continua
- Computability and Representations of the Zero Set
- An intuitionist correction of the fixed-point theorem on the sphere
