Games for Inclusion Logic and Fixed-Point Logic

Erich Grädel ()
Additional contact information
Erich Grädel: RWTH Aachen University, Math. Foundations of Computer Science

A chapter in Dependence Logic, 2016, pp 73-98 from Springer

Abstract: Abstract One of the most intriguing results on logics of dependence and independence is the tight connection between inclusion logic and the least fixed-point logic LFP. Here we re-examine this connection from a game-theoretic point of view. We study the model-checking games for inclusion logic and for posGFP, the fragment of LFP that uses only (non-negated) greatest fixed points. We show that the evaluation problems for both logics can be represented by a special kind of trap condition in safety games. We then study interpretation arguments for games. In combination with our study of traps for inclusion logic and posGFP, game interpretations will give us a model-theoretic construction of translations between the two logics.

Keywords: Winning Strategy; Dependence Logic; Game Graph; Winning Condition; Negation Normal Form (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-31803-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319318035

DOI: 10.1007/978-3-319-31803-5_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().