A complete proof system for propositional projection temporal logic (2013)

Author(s): Duan Z, Zhang N, Koutny M

    Abstract: The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To facilitate proofs, some of the frequently used theorems are proved. A normal form of PPTL formulas is presented, and the soundness and completeness of the proof system are demonstrated. To show how the axiom system works, a full omega regular property for the mutual exclusion problem is specified by a PPTL formula and then a deductive proof of the property is performed.

      • Date: 24-01-2012
      • Journal: Theoretical Computer Science
      • Issue: epub ahead of print
      • Publisher: Elsevier BV
      • Publication type: Article
      • Bibliographic status: Published

      Keywords: Temporal logic; Axiomatization; Soundness; Completeness; Inference rule

      Staff

      Professor Maciej Koutny
      Professor of Computing Science