Propositional dynamic logic for searching games with errors
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2014
- DOI:
- 10.48550/arXiv.1401.7234
- arXiv:
- arXiv:1401.7234
- Bibcode:
- 2014arXiv1401.7234T
- Keywords:
-
- Computer Science - Logic in Computer Science;
- 03B45;
- 03B70;
- 03B50