Borel complexity and computability of the Hahn-Banach theorem (Q926175)

From MaRDI portal
Revision as of 10:46, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Borel complexity and computability of the Hahn-Banach theorem
scientific article

    Statements

    title
    Borel complexity and computability of the Hahn-Banach theorem (English)
    0 references
    author
    Vasco Brattka
    0 references
    publication date
    26 May 2008
    0 references
    zbMATH Keywords
    Computable analysis
    0 references
    Functional analysis
    0 references
    Effective descriptive set theory
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03F60
    0 references
    03D45
    0 references
    03E15
    0 references
    46A22
    0 references
    46S30
    0 references
    zbMATH DE Number
    5278966
    0 references
    OpenAlex ID
    W2005943267
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q926175&oldid=35057821"
    Powered by MediaWiki