How Incomputable is the Separable Hahn-Banach Theorem?
From MaRDI portal
Publication:4918007
DOI10.1016/j.entcs.2008.12.009zbMath1262.03082OpenAlexW2027051973MaRDI QIDQ4918007
Alberto Marcone, Guido Gherardi
Publication date: 3 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.009
reverse mathematicsHahn-Banach extension theoremweak König's lemmacomputable analysismulti-valued functions
Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Constructive functional analysis (46S30) Computation over the reals, computable analysis (03D78)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed point theory in weak second-order arithmetic
- Borel complexity and computability of the Hahn-Banach theorem
- Computability on subsets of metric spaces.
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
- Effective Borel measurability and reducibility of functions
- Computable functionals
- Separation and Weak König's Lemma
- Computable metrization
- Borel Complexity of Topological Operations on Computable Metric Spaces