Date of Original Version

2005

Type

Article

Rights Management

All Rights Reserved

Abstract or Description

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-theoretical argument, which provides no apparent bounds on the complexity of a decision procedure. We provide a syntactical argument that yields a procedure that is primitive recursive, although not elementary.

DOI

10.1016/j.tcs.2006.10.005

Included in

Philosophy Commons

Share

COinS