Labelled proofs for quantified modal logic [chapter]

Alberto Artosi, Paola Benassi, Guido Governatori, Antonino Rotolo
1996 Lecture Notes in Computer Science  
In this paper we describe a modal proof system arising from the combination of a tableau-like classical system, which incorporates a restricted ("analytic") version of the cut rule, with a label formalism which allows for a specialised, logic-dependent unification algorithm. The system provides a uniform proof-theoretical treatment of first-order (normal) modal logics with and without the Barcan Formula and/or its converse.
doi:10.1007/3-540-61630-6_5 fatcat:y4taichtfzbvvhnlmbcdyhedcq