A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Labelled proofs for quantified modal logic
[chapter]
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