Local Normal Forms for First-Order Logic with Applications to Games and Automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 1999

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

Résumé

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.
Fichier principal
Vignette du fichier
dm030303.pdf (220.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00958930 , version 1 (13-03-2014)

Identifiants

Citer

Thomas Schwentick, Klaus Barthelmann. Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discrete Mathematics and Theoretical Computer Science, 1999, Vol. 3 no. 3 (3), pp.109-124. ⟨10.46298/dmtcs.254⟩. ⟨hal-00958930⟩

Collections

TDS-MACS
65 Consultations
1188 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More