On Σ‐definability without equality over the real numbers

DOI10.1002/MALQ.200710064MaRDI QIDQ3528148zbMATH OpenOpenAlexFDO

Authors Andrei S. Morozov, M. V. Korovina

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

\(\Sigma\)-definabilitycomputably enumerable open setreal numbers

Mathematics Subject Classification ID

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) Constructive and recursive analysis (03F60) Constructive real analysis (26E40)

Recommendations

• Remarks on \(\Sigma\)-definability without the equality test over the reals
• Computer Science Logic
• Σ-Definability of countable structures over real numbers, complex numbers, and quaternions
• Definability in Rationals with Real Order in the Background
• Definability in o-minimal expansions of the real numbers
• ∑ n Definable Sets without ∑ n Induction
• Definability and undefinability with real order at the background
• On Σ₁‐definable Functions Provably Total in I ∏
• Regularity properties of definable sets of reals
• -decidability over the reals

Cites work

• Abstract First Order Computability. I
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Computer Science Logic
• Equality is a jump
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 554481 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1841818 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• Recent advances in -definability over continuous data types
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• The Uniformity Principle for Σ-Definability with Applications to Computable Analysis

Cited in

(13)

• A topological view on algebraic computation models
• On Σ¹ ₁ equivalence relations over the natural numbers
• Gandy's theorem for abstract structures without the equality test
• Σ-Definability of countable structures over real numbers, complex numbers, and quaternions
• ∑ n Definable Sets without ∑ n Induction
• Definability and undefinability with real order at the background
• Computable elements and functions in effectively enumerable topological spaces
• Fixed points on the real numbers without the equality test
• Remarks on \(\Sigma\)-definability without the equality test over the reals
• Computer Science Logic
• Computable functors and effective interpretability
• Positive predicate structures for continuous data
• A c.e. real that cannot be sw-computed by any \(\Omega\) number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528148)