How incomputable is the separable Hahn-Banach theorem?

DOI10.1215/00294527-2009-018zbMath1223.03052arXiv0808.1663OpenAlexW1987187730MaRDI QIDQ987935

Alberto Marcone, Guido Gherardi

Publication date: 2 September 2010

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.1663

zbMATH Keywords

multivalued functionsHahn-Banach extension theoremweak König's lemmacomputable analysis, reverse mathematics

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Foundations of classical theories (including reverse mathematics) (03B30) Constructive functional analysis (46S30)

Related Items (26)

On the uniform computational content of the Baire category theorem ⋮ Computability and Analysis, a Historical Approach ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Primitive recursive reverse mathematics ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ On the uniform computational content of computability theory ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Closed choice and a uniform low basis theorem ⋮ The Vitali Covering Theorem in the Weihrauch Lattice ⋮ Many-one reductions and the category of multivalued functions ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ On the algebraic structure of Weihrauch degrees ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Weihrauch degrees, omniscience principles and weak computability ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computability of the Radon-Nikodym Derivative ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE ⋮ Probabilistic computability and choice ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency

This page was built for publication: How incomputable is the separable Hahn-Banach theorem?