The Uniformity Principle for Σ-Definability with Applications to Computable Analysis

DOI10.1007/978-3-540-73001-9_43zbMath1150.03314OpenAlexW1881350930MaRDI QIDQ5425343

Oleg V. Kudinov, Margarita Korovina

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_43

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computable structure theory, computable model theory (03C57) Higher-type and set recursion theory (03D65)

Related Items (4)

On Σ‐definability without equality over the real numbers ⋮ Towards Computability over Effectively Enumerable Topological Spaces ⋮ Remarks on Σ–definability without the equality test over the Reals ⋮ Positive predicate structures for continuous data

This page was built for publication: The Uniformity Principle for Σ-Definability with Applications to Computable Analysis