Propositional dynamic logic for searching games with errors
Logic in Computer Science
2014-01-29 v1
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 {\L}ukasiewicz many-valued logic. We illustrate the definitions by providing a framework for an analysis of the R\'enyi - 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.
Cite
@article{arxiv.1401.7234,
title = {Propositional dynamic logic for searching games with errors},
author = {Bruno Teheux},
journal= {arXiv preprint arXiv:1401.7234},
year = {2014}
}