Beschreibung:
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it is false. This correspondence has been known for a very long time and has inspired numerous research directions. In this book, the author extends this connection between logic and games to the class of automatic structures, where relations are recognized by synchronous finite automata.
1 Logics, Structures and Presentations.- 2 Game Quantifiers on Automatic Presentations.- 3 Games for Model Checking on Automatic Structures.- 4 Memory Structures for Infinitary Games.- 5 Counting Quantifiers on Automatic Structures.- 6 Cardinality Quantifiers in MSO on Linear Orders.- 7 Cardinality Quantifiers in MSO on Trees.- 8 Outlook.