Ehrenfeucht-Fraïssé goes automatic for real addition

@article{Klaedtke2010EhrenfeuchtFrassGA,
  title={Ehrenfeucht-Fra{\"i}ss{\'e} goes automatic for real addition},
  author={Felix Klaedtke},
  journal={Inf. Comput.},
  year={2010},
  volume={208},
  pages={1283-1295}
}
Various logical theories can be decided by automata-theoretic methods. Notable examples are Presburger arithmetic FO(Z, +, <) and the linear arithmetic over the reals FO(R, +, <), for which effective decision procedures can be built using automata. Despite the practical use of automata to decide logical theories, many research questions are still only partly answered in this area. One of these questions is the complexity of such decision procedures and the related question about the minimal… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Similar Papers

Loading similar papers…