A Hierarchical Completeness Proof for Propositional Temporal Logic


We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). This makes use of a natural hierarchy of logics and notions and is an interesting alternative to the proofs in the literature based on tableaux, filtration, game theory and other methods. In… (More)
DOI: 10.1007/978-3-540-39910-0_22


2 Figures and Tables