| 书目名称 | Logic and Games on Automatic Structures |
| 副标题 | Playing with Quantif |
| 编辑 | Łukasz Kaiser |
| 视频video | |
| 概述 | Innovative study in the area of algorithmic model theory.Based on awarded dissertation.State-of-the-art research |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | .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..In model-checking games for automatic structures, two coalitions play against each other with a particular kind of hierarchical imperfect information. The investigation of such games leads to the introduction of a game quantifier on automatic structures, which connects alternating automata with the classical model-theoretic notion of a game quantifier. This study is then extended, determining the memory needed for strategies in infinitary games on the one hand, and characterizing regularity-preserving Lindström quantifiers on the other. Counting quantifiers are investigated in depth: it is shown that all countable omega-automatic structures are in fact finite-word automatic and that the infinity and uncountability set quantifiers are defina |
| 出版日期 | Book 2011 |
| 关键词 | Game theory; Generalized quantifiers; Imperfect information games; Model checking |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-22807-0 |
| isbn_softcover | 978-3-642-22806-3 |
| isbn_ebook | 978-3-642-22807-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag GmbH Berlin Heidelberg 2011 |
发表于 2025-3-21 16:17:25
