Relative computability and uniform continuity of relations

DOI10.4115/jla.2013.5.7zbMath1345.03086arXiv1105.3050OpenAlexW2167006824MaRDI QIDQ2930869

Martin Ziegler, Arno Pauly

Publication date: 20 November 2014

Published in: Journal of Logic and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.3050

zbMATH Keywords

Henkin quantifieruniform continuitymultivaluedness

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Computation over the reals, computable analysis (03D78)

Related Items (14)

The fixed-point property for represented spaces ⋮ Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ Unnamed Item ⋮ Computations with oracles that measure vanishing quantities ⋮ Many-one reductions and the category of multivalued functions ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ A Wadge hierarchy for second countable spaces ⋮ Exploring the beta quadrant ⋮ Uniform continuity of relations and nondeterministic cellular automata ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Continuous and monotone machines ⋮ Quantitative coding and complexity theory of compact metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
• Computability in linear algebra
• Compactness in constructive analysis revisited
• Some applications of Henkin quantifiers
• Recursive characterization of computable real-valued functions and relations
• Weihrauch degrees, omniscience principles and weak computability
• Spaces allowing Type‐2 Complexity Theory revisited
• The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
• Computational complexity on computable metric spaces

This page was built for publication: Relative computability and uniform continuity of relations