zbMATH — the first resource for mathematics

S4LP and local realizability. (English) Zbl 1143.03009
Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. Third international computer science symposium in Russia, CSR 2008 Moscow, Russia, June 7–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79708-1/pbk). Lecture Notes in Computer Science 5010, 168-179 (2008).
Summary: The logic S4LP combines the modal logic S4 with the justification logic LP, both axiomatically and semantically. We introduce a simple restriction on the behavior of constants in S4LP, having no effect on the LP sublogic. Under this restriction some powerful derived rules are established. Then these are used to show completeness relative to a semantics having what we call the local realizability property: at each world and for each formula true at that world there is a realization also true at that world, where a realization is the result of replacing all modal operators with explicit justification terms. This is a part of a project to understand the deeper aspects of Artemov’s Realization Theorem.
For the entire collection see [Zbl 1136.68005].
03B45 Modal logic (including the logic of norms)
03B42 Logics of knowledge and belief (including belief change)
03F45 Provability logics and related algebras (e.g., diagonalizable algebras)
PDF BibTeX Cite
Full Text: DOI