A Labelled Sequent Calculus for Public Announcement Logic

07/21/2022
by   Hao Wu, et al.
0

Public announcement logic(PAL) is an extension of epistemic logic (EL) with some reduction axioms. In this paper, we propose a cut-free 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2019

Automated proof search system for logic of correlated knowledge

The automated proof search system and decidability for logic of correlat...
research
05/15/2019

A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic

We define a infinitary labelled sequent calculus for PDL, G3PDL^∞. A fin...
research
03/02/2018

Classical Transitions

We introduce the calculus of Classical Transitions (CT), which extends t...
research
03/26/2022

Algorithmic correspondence and analytic rules

We introduce the algorithm MASSA which takes classical modal formulas in...
research
11/06/2019

Display to Labelled Proofs and Back Again for Tense Logics

We introduce translations between display calculus proofs and labelled c...
research
07/31/2023

On the semantics of proofs in classical sequent calculus

We discuss the problem of finding non-trivial invariants of non-determin...
research
09/25/2019

Iterative division in the Distributive Full Non-associative Lambek Calculus

We study an extension of the Distributive Full Non-associative Lambek Ca...

Please sign up or login with your details

Forgot password? Click here to reset