On the uniform computational content of the Baire category theorem
V Brattka, M Hendtlass, AP Kreuzer - 2018 - projecteuclid.org
We study the uniform computational content of different versions of the Baire category
theorem in the Weihrauch lattice. The Baire category theorem can be seen as a pigeonhole
principle that states that a complete (ie,“large”) metric space cannot be decomposed into
countably many nowhere dense (ie, small) pieces. The Baire category theorem is an
illuminating example of a theorem that can be used to demonstrate that one classical
theorem can have several different computational interpretations. For one, we distinguish …
theorem in the Weihrauch lattice. The Baire category theorem can be seen as a pigeonhole
principle that states that a complete (ie,“large”) metric space cannot be decomposed into
countably many nowhere dense (ie, small) pieces. The Baire category theorem is an
illuminating example of a theorem that can be used to demonstrate that one classical
theorem can have several different computational interpretations. For one, we distinguish …
[CITATION][C] On the uniform computational content of the Baire category theorem (2015)
V Brattka, M Hendtlass, AP Kreuzer - CoRR arXiv
Showing the best results for this search. See all results