Remarks on -definability without the equality test over the reals

DOI10.1016/J.ENTCS.2008.03.023MaRDI QIDQ4918045zbMATH OpenOpenAlexFDO

Authors Andrei S. Morozov, M. V. Korovina

Publication date 3 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.03.023

zbMATH Keywords

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

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Recommendations

• Computer Science Logic
• On Σ‐definability without equality over the real numbers
• Recent advances in -definability over continuous data types
• Computable model theory over the reals
• Fixed points on the real numbers without the equality test

Cites work

• Computer Science Logic
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 1841818 (Why is no real title available?)
• scientific article; zbMATH DE number 890268 (Why is no real title available?)
• The Uniformity Principle for Σ-Definability with Applications to Computable Analysis

Cited in

(10)

• Equality is a jump
• On the index sets of -subsets of the real numbers
• On Σ‐definability without equality over the real numbers
• The Uniformity Principle for  -definability
• ∑ n Definable Sets without ∑ n Induction
• Fixed points on the real numbers without the equality test
• Computer Science Logic
• The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
• Recent advances in -definability over continuous data types
• A remark on $\mathscr C^\infty $ definable equivalence

This page was built for publication: Remarks on \(\Sigma\)-definability without the equality test over the reals

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