Effectively open real functions

DOI10.1016/j.jco.2006.05.002zbMath1126.03042OpenAlexW2040831823MaRDI QIDQ864433

Martin Ziegler

Publication date: 8 February 2007

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.05.002

zbMATH Keywords

quantifier eliminationtopologyopen mapping theoremrecursion theorycomputable analysis

Mathematics Subject Classification ID

Special maps on topological spaces (open, closed, perfect, etc.) (54C10) Constructive and recursive analysis (03F60) Constructive real analysis (26E40) Theory of numerations, effectively presented structures (03D45) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (3)

Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ Computability aspects for 1st-order partial differential equations via characteristics ⋮ Computable Complex Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability in linear algebra
• Equality is a jump
• An effective Riemann Mapping Theorem
• Foundation of a computable solid modelling.
• Computable operators on regular sets
• On the definitions of computable real continuous functions
• Computability of convex sets
• Computability on Regular Subsets of Euclidean Space
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Algorithms in real algebraic geometry

This page was built for publication: Effectively open real functions