Skip to content
Preprint

A minimal intuitionistic public announcement logic

Nov 2026 · 1 citation · 31 references
Computer Science

Abstract

We introduce intuitionistic public announcement logics Lmin and Lequ determined by classes of birelational frames where the intuitionistic preorder and the modal accessibility relation do not need to satisfy the confluence conditions traditionally considered within the framework of IPAL. Our logics can be seen as generalisations of IPAL seeing that their language is based on a binary epistemic modality of"relativised knowledge"that allows us to define valid reduction axioms. Our main results are the soundness and completeness of Lmin with respect to the class of all birelational frames and the soundness and completeness of Lequ with respect to the class of all birelational frames where the modal accessibility relation is an equivalence relation.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.