A Labelled Sequent Calculus for Public Announcement Logic

Abstract

Public announcement logic (PAL) is an extension of epistemic logic (EL) with some reduction axioms. In this paper, we propose a cutfree labelled sequent calculus for PAL, which is an extension of that for EL with sequent rules adapted from the reduction axioms. This calculus admits cut and allows terminating proof search.