Connected choice and the Brouwer fixed point theorem
- Submitting institution
-
Swansea University / Prifysgol Abertawe
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 48651
- Type
- D - Journal article
- DOI
-
10.1142/s0219061319500041
- Title of journal
- Journal of Mathematical Logic
- Article number
- -
- First page
- 1950004
- Volume
- 19
- Issue
- 01
- ISSN
- 0219-0613
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Over the past decade Weihrauch complexity has developed as a vibrant research field (e.g., with two Dagstuhl seminars). A core question addressible uniquely in our framework is how often one needs to invoke certain axioms to prove some theorem. A flagship problem showcasing this was: Is a single application of Brouwer's Fixed Point theorem in dimension 2 sufficient to prove Weak Königs Lemma. This question remained open for several years before a positive answer was provided in this paper. The technical tools introduced here have already proven their usefulness in subsequent work.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -