# Local Normal Forms for First-Order Logic with Applications to Games and Automata

Local Normal Forms for First-Order Logic with Applications to Games and Automata - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 Institut für Informatik - Institute of Computer Science Mainz

Abstract : 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, \forall 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. \par From this and related normal forms, variants of the Ehrenfeucht game for first-order and existential monadic second-order logic are developed that restrict the possible strategies for the spoiler, one of the two players. This makes proofs of the existence of a winning strategy for the duplicator, the other player, easier and can thus simplify inexpressibility proofs. \par As another application, automata models are defined that have, on arbitrary classes of relational structures, exactly the expressive power of first-order logic and existential monadic second-order logic, respectively.

Keywords : First-order logic existential monadic second-order logic games automata locality

Autor: Thomas Schwentick - Klaus Barthelmann -

Fuente: https://hal.archives-ouvertes.fr/

DESCARGAR PDF