Focused Labeled Proof Systems for Modal Logic
نویسندگان
چکیده
Focused proofs are sequent calculus proofs that group inference rules into alternating negative and positive phases. These phases can then be used to define macro-level inference rules from Gentzen’s original and tiny introduction and structural rules. We show here that the inference rules of labeled proof systems for modal logics can similarly be described as pairs of such negative and positive phases within the LKF focused proof system (which contains no modal connectives). In particular, we consider the system G3K of Negri for the modal logic K and define a translation from labeled modal formulas into first-order polarized formulas and show a strict correspondence between derivations in the two systems, i.e., each rule application in G3K corresponds to a bipole— a pair of a positive and a negative phases—in LKF. Since, geometric axioms (when properly polarized) induce bipoles, this strong correspondence holds for modal logics whose Kripke frames are characterized by geometric properties. We extend these results to present a focused labeled proof system for this same class of modal logics and show its soundness and completeness. This resulting proof system allows one to define a rich set of normal forms of modal logic proofs. 1998 ACM Subject Classification F.4.1 Mathematical Logic: Modal logic, Proof Theory
منابع مشابه
A focused framework for emulating modal proof systems
Several deductive formalisms (e.g., sequent, nested sequent, labeled sequent, hypersequent calculi) have been used in the literature for the treatment of modal logics, and some connections between these formalisms are already known. Here we propose a general framework, which is based on a focused version of the labeled sequent calculus by Negri, augmented with some parametric devices allowing t...
متن کاملThe Contribution of A.v. Kuznetsov to the Theory of Modal Systems and Structures
We will outline the contributions of A.V. Kuznetsov to modal logic. In his research he focused mainly on semantic, i.e. algebraic, issues and lattices of extensions of particular modal logics, though his proof of the Full Conservativeness Theorem for the proof-intuitionistic logic KM (Theorem 17 below) is a gem of proof-theoretic art.
متن کاملA Tableau Compiled Labelled Deductive System for Hybrid Logic
Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. ...
متن کاملA general proof certification framework for modal logic
One of the main issues in proof certification is that different theorem provers, even when designed for the same logic, tend to use different proof formalisms and to produce outputs in different formats. The project ProofCert promotes the usage of a common specification language and of a small and trusted kernel in order to check proofs coming from different sources and for different logics. By...
متن کاملKE Tableaux for Public Announcement Logic
Public announcement logic (PAL) is a simple dynamic epistemic logic extending reasoning about knowledge of agents with a modal operator for simultaneous and transparent knowledge updates. This logic is no more expressive than epistemic logic (EL) without updates, but exhibits compact representation of a number of complex epistemic situations. A labeled tableau proof system to reason with these ...
متن کامل