A computable version of Banach's inverse mapping theorem

DOI10.1016/j.apal.2008.09.002zbMath1159.03041OpenAlexW2052053709MaRDI QIDQ1006604

Vasco Brattka

Publication date: 25 March 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.002

zbMATH Keywords

effective descriptive set theorycomputable functional analysis

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Constructive functional analysis (46S30) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Computability and Analysis, a Historical Approach ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Semi-metrics, closure spaces and digital topology
• Mathematics based on incremental learning -- excluded middle and inductive inference
• Borel complexity and computability of the Hahn-Banach theorem
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on subsets of metric spaces.
• Extended admissibility.
• Effective Borel measurability and reducibility of functions
• On the definitions of computable real continuous functions
• 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

This page was built for publication: A computable version of Banach's inverse mapping theorem