On the Uniform Computational Content of the Baire Category Theorem
On the Uniform Computational Content of the Baire Category Theorem
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 (i.e., "large") metric space cannot be decomposed into countably many nowhere dense (i.e., "small") pieces. The …