[en] 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.
Disciplines :
Mathematics Computer science
Author, co-author :
TEHEUX, Bruno ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
Language :
English
Title :
Propositional Dynamic Logic for Searching Games with Errors
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
