Local Normal Forms for First-Order Logic with Applications to Games and Automata
Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x 1,...,x l, ∀ y, φ where φ is r-local around y, i.e. quantification in φ is restricted to elements of the universe of distance at most r from y. From this a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
1999-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/101 |