On Σ‐definability without equality over the real numbers

DOI10.1002/malq.200710064zbMath1155.03045OpenAlexW2008842537MaRDI QIDQ3528148

Margarita Korovina, Andrey S. Morozov

Publication date: 8 October 2008

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200710064

zbMATH Keywords

real numbers\(\Sigma\)-definabilitycomputably enumerable open set

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Constructive real analysis (26E40) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (4)

A topological view on algebraic computation models ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY ⋮ Positive predicate structures for continuous data

Cites Work

• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• Equality is a jump
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Computer Science Logic
• The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
• Abstract First Order Computability. I
• Perspectives of System Informatics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Σ‐definability without equality over the real numbers