Presburger Arithmetic: From Automata to Formulas
Presburger arithmetic is the first-order theory of the integers with addition and ordering, but without multiplication. This theory is decidable and the sets it defines admit several different representations, including formulas, generators, and finite automata, the latter being the focus of this th...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Universite de Liege
2005
|
| Subjects: | |
| Online Access: | http://bictel.ulg.ac.be/ETD-db/collection/available/ULgetd-05212007-145638/ |