| Reference : Propositional Dynamic Logic for Searching Games with Errors |
| Scientific journals : Article | |||
| Physical, chemical, mathematical & earth Sciences : Mathematics Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/16335 | |||
| Propositional Dynamic Logic for Searching Games with Errors | |
| English | |
Teheux, Bruno  [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >] | |
| 2014 | |
| Journal of Applied Logic | |
| Elsevier | |
| 12 | |
| 4 | |
| 377-394 | |
| Yes (verified by ORBilu) | |
| International | |
| 1570-8683 | |
| 1570-8691 | |
| [en] propositional dynamic logic ; many-valued logic ; modal logic | |
| [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. | |
| F1R-MTH-PUL-12RDO2 > MRDO2 > 01/02/2012 - 31/01/2015 > MARICHAL Jean-Luc | |
| Researchers | |
| http://hdl.handle.net/10993/16335 | |
| http://dx.doi.org/10.1016/j.jal.2014.04.001 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
