There are no interesting consistent and complete axiom systems (recently discussed here by probabilistic approches).
This depends pretty heavily on what you mean by interesting, since it requires something like being able to model Peano Arithmetic or at least Robinson arithmetic. But first order reals or first order C are “interesting” systems (in the sense that we study them and there are open problems that can be phrased in terms of them) and are consistent and complete.
First order reals [...] are “interesting” systems (in the sense that we study them and there are open problems that can be phrased in terms of them) and are consistent and complete.
This depends pretty heavily on what you mean by interesting, since it requires something like being able to model Peano Arithmetic or at least Robinson arithmetic. But first order reals or first order C are “interesting” systems (in the sense that we study them and there are open problems that can be phrased in terms of them) and are consistent and complete.
I wasn’t aware of that. Can you give some link?
See here.
Thanks.
I know quantifier elimination from CS and it makes for some useful practical algorithms but it seems not to be very powerful.