Quantcast
Channel: What theories are larger than the real closed field but still decidable? - MathOverflow
Browsing all 3 articles
Browse latest View live

Answer by user44143 for What theories are larger than the real closed field...

You can add a predicate for the integer powers of two and retain decidability. There was a previous question about that theory, and my comment there links to an algorithm for quantified elimination in...

View Article



Answer by Ali Enayat for What theories are larger than the real closed field...

Thanks to a 1958 paper by Abraham Robinson (whose impetus was a question of Alfred Tarski), an example of such a theory that properly extends RCF is the theory of the structure...

View Article

What theories are larger than the real closed field but still decidable?

It's well known that sentences about the real closed field can be decided by algorithm and the complexity of this is about $d^{2^{O(n)}}$ where $d$ is the product of the degrees of polynomials in the...

View Article
Browsing all 3 articles
Browse latest View live




Latest Images