2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
A Complete Axiomatization of Propositional Projection Temporal Logic
June 17-June 19
ISBN: 978-0-7695-3249-3
DOI Bookmark:
http://doi.ieeecomputersociety.org/10.1109/TASE.2008.22
This paper investigates a complete axiomatic system for Propositional Projection Temporal Logic (PPTL). To this end, the syntax, semantics, and logic laws of PPTL are briefly introduced. Further, the normal form of PPTL formulas is presented.??Moreover, an axiomatic system of PPTL is formalized. A set of axioms and inference rules are given in details. To assist the proof within the system, some theorems are proved by means of the axioms and rules. In addition, based on the axioms, rules and theorems, the soundness and completeness of the deductive system are proved. Finally, an example is given to illustrate how the axiom system works.
Index Terms:
temporal logic, projection, axiom, inference rules, completeness
Citation:
Zhenhua Duan, Nan Zhang, "A Complete Axiomatization of Propositional Projection Temporal Logic," tase, pp.271-278, 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, 2008
Usage of this product signifies your acceptance of the
Terms of Use.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||