Thompson transformations for IF-logic

F. Dechesne

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)


In this paper we study connections between game theoretical concepts and results, and features of IF-predicate logic, extending observations from J. van Benthem (2001) for IF-propositional logic. We highlight how both characteristics of perfect recall can fail in the semantic games for IF-formulas, and we discuss the four Thompson transformations in relation with IF-logic. Many (strong) equivalence schemes for IF-logic correspond to one or more of the transformations. However, we also find one equivalence that does not fit in this picture, by the type of imperfect recall involved. We point out that the connection between the transformations and logical equivalence schemes is less direct in IF-first order logic than in the propositional case. The transformations do not generate a reduced normal form for IF-logic, because the IF-language is not flexible enough.
Original languageEnglish
Pages (from-to)285-309
Issue number2
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'Thompson transformations for IF-logic'. Together they form a unique fingerprint.

Cite this