Borel complexity and computability of the Hahn-Banach theorem
type: Item
instance of: scholarly article
title: Borel complexity and computability of the Hahn-Banach theorem
zbMATH Open document ID: 1140.03040
author: Vasco Brattka
published in: Archive for Mathematical Logic
publication date: 2008-05-26T00:00:00Z
Mathematics Subject Classification ID: 03F60
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03E15
Mathematics Subject Classification ID: 46A22
Mathematics Subject Classification ID: 46S30
zbMATH DE Number: 5278966
zbMATH Keywords: Computable analysis
zbMATH Keywords: Functional analysis
zbMATH Keywords: Effective descriptive set theory
MaRDI profile type: Publication
full work available at URL: s00153-007-0057-z
OpenAlex ID: W2005943267
cites work: Q3803111
cites work: Q4779146
cites work: Q4418667
cites work: Q5718580
cites work: Effective Borel measurability and reducibility of functions
cites work: Q5494231
cites work: Computability on subsets of metric spaces.
cites work: Q3754620
cites work: Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field
cites work: Q3994935
cites work: On a theorem by A. E. Taylor
cites work: Q5733836
cites work: On the definitions of computable real continuous functions
cites work: On the Constructive Hahn-Banach Theorem
cites work: An omniscience principle, the König Lemma and the Hahn‐Banach theorem
cites work: Q5848892
cites work: Q4749832
cites work: Convex functions, monotone operators and differentiability
cites work: Q3994907
cites work: Q4353856
cites work: Q4220572
cites work: Linear Hahn–Banach extension operators
cites work: The extension of linear functionals
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: Q4485693
cites work: Q4531998
DOI: 10.1007/S00153-007-0057-Z
description: scientific article; zbMATH DE number 5278966