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

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

2006-10-19

arxiv.org/abs/cs/0610117v1

Computer Science

Logic in Computer Science

Scientific paper

In 1985, van den Dries showed that the theory of the reals with a predicate for the integer powers of two admits quantifier elimination in an expanded language, and is hence decidable. He gave a model-theoretic argument, which provides no apparent bounds on the complexity of a decision procedure. We provide a syntactic argument that yields a procedure that is primitive recursive, although not elementary. In particular, we show that it is possible to eliminate a single block of existential quantifiers in time $2^0_{O(n)}$, where $n$ is the length of the input formula and $2_k^x$ denotes $k$-fold iterated exponentiation.

Affiliated with

Also associated with

No associations

Rating

Quantifier elimination for the reals with a predicate for the powers of two does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantifier elimination for the reals with a predicate for the powers of two, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantifier elimination for the reals with a predicate for the powers of two will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-12623