Semantic Games with Backtracking for Fuzzy Logics
Christian G. Fermüller · 2014
Hintikka's game theoretic semantics for classical connectives and quantifiers has been generalized to many-valued logics in various ways. After providing a short overview, we introduce a new type of semantic games: backtracking games, where a stack of formulas is used to store information on how to continue the game even after reaching an atomic formula. We present backtracking games for the three fundamental t-norm based logics: Lukasiewicz, Gödel, and Product logic and provide corresponding adequateness theorems.