Borel complexity and computability of the Hahn-Banach theorem

DOI10.1007/S00153-007-0057-ZzbMath1140.03040OpenAlexW2005943267MaRDI QIDQ926175

Vasco Brattka

Publication date: 26 May 2008

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-007-0057-z

zbMATH Keywords

Functional analysisComputable analysisEffective descriptive set theory

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Constructive functional analysis (46S30) Theory of numerations, effectively presented structures (03D45)

Related Items (12)

Computability and Analysis, a Historical Approach ⋮ The uniform content of partial and linear orders ⋮ Ramsey’s theorem for singletons and strong computable reducibility ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Computability of finite-dimensional linear subspaces and best approximation ⋮ Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces ⋮ How Incomputable is the Separable Hahn-Banach Theorem? ⋮ A computable version of Banach's inverse mapping theorem ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Problems, solutions, and completions ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Convex functions, monotone operators and differentiability
• Computability on subsets of metric spaces.
• The extension of linear functionals
• Effective Borel measurability and reducibility of functions
• On the definitions of computable real continuous functions
• On a theorem by A. E. Taylor
• Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field
• On the Constructive Hahn-Banach Theorem
• Linear Hahn–Banach extension operators
• An omniscience principle, the König Lemma and the Hahn‐Banach theorem
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Borel complexity and computability of the Hahn-Banach theorem