Propositional dynamic logic for searching games with errors

2014/01/28 by Teheux, Bruno · 1 citation
#03B45 #03B50 #03B70 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.1401.7234

Abstract

We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of Łukasiewicz many-valued logic. We illustrate the definitions by providing a framework for an analysis of the Rényi - Ulam searching game with errors. Our main result is the axiomatization of the theory of the (n+1)-valued Kripke models. This result is obtained through filtration of the canonical model of the smallest (n+1)-valued propositional dynamic logic.

Cited by

• Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility

Related

• Towards a Coalgebraic Interpretation of Propositional Dynamic Logic
• A Fixed-Parameter Study on Propositional Dynamic Logic
• Generalizations of Mezhirov's game semantics to predicate superintuitionistic logics and the Casari formula
• Ordered Kripke Model, Permissibility, and Convergence of Probabilistic\n Kripke Model
• The Succinctness of First-order Logic over Modal Logic via a Formula Size Game