Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Logic and Games on Automatic Structures

# Logic and Games on Automatic Structures

Ratings: (0)|Views: 52|Likes:

### Availability:

See more
See less

08/29/2011

pdf

text

original

L
 
G
 
A

S

Von der Fakult
ä
t f
ü
r Mathematik, Informatik und Naturwissenschaen
eines Doktors der Naturwissenschaen genehmigte Dissertation vorgelegt vonDipl.-Math., Dipl.-Inform.
Łukasz Kaiser
aus Wroc
ł
aw, PolenBerichter: Prof. Dr. Erich Gr
ä
delProf. Dr. Joost-Pieter KatoenProf. Dr. Damian Niwi
ń
skiTag der m
ü
ndlichen Pr
ü
fung: . Juni 
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verf
ü
gbar.

ii

Preface
An important connection between logic and games is based on the corre-spondence between the evaluation of a logical formula and a game played
by two opponents, one trying to show that the formula is true and the
other trying to prove it false.
is relationship has been implicitly known
for a long time, even before mathematical logic and game theory wereformalized. It was formally established in the s by Paul Lorenzen
,
] in the form of dialogue games and later developed in another
form by Jaakko Hintikka [
]. Since then, it has inspired numerous re-
the classical ones.
In computer science, there are two main approaches to algorithmically exploitingthecorrespondencebetweenlogicandgames. Ontheonehand,gamesplayedonsyntacticobjectssuchasformulas, programsorlanguage
expressions were studied. Such games, derived from the dialogue games
of Lorenzen and their extensions, were used to build theorem provers
for classical and intuitionistic rst-order logic [
], to give semantics to
programming languages and to verify programs[
], and in various othercontexts in linguistics and articial intelligence (see [
]for an overview).
On the other hand, games can be played in a more semantic setting,
where players choose elements of a mathematical structure. In this way,following the ideas of Hintikka, games are used to evaluate formulas of
both rst-order and second-order logic on nite structures and to verify
temporal properties on Kripke structures.
e algorithmic utility of such semantic games is apparent in the ver-
ication of
µ
-calculus formulas on nite structures. While there is noknown polynomial-time algorithm for this problem, parity and mean-payo games were used to narrow its complexity class[
], to obtain
algorithms that are among the most ecient ones in practice [
], and
iii