Quantifier elimination for the reals with a predicate for the powers of two

DOI10.1016/j.tcs.2006.10.005zbMath1113.03027arXivcs/0610117OpenAlexW2126527995MaRDI QIDQ868941

Yimu Yin, Jeremy Avigad

Publication date: 26 February 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

quantifier eliminationreal closed fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Model theory of fields (12L12) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (2)

Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers ⋮ A generalization of Cobham's theorem to automata over real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of almost linear diophantine problems
• The field of reals with a predicate for the powers of two
• The computational complexity of logical theories
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
• New results on quantifier elimination over real closed fields and applications to constraint databases
• Alfred Tarski's elimination theory for real closed fields
• THE FIELDS OF REAL AND COMPLEX NUMBERS WITH A SMALL MULTIPLICATIVE GROUP
• Expansions of o-minimal structures by fast sequences
• Algorithms in real algebraic geometry

This page was built for publication: Quantifier elimination for the reals with a predicate for the powers of two