• DOI:10.3166/jancl.14.55-104
• Corpus ID: 28627910

A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time

@article{Moszkowski2004AHC,
  title={A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time},
  author={Ben C. Moszkowski},
  journal={Journal of Applied Non-Classical Logics},
  year={2004},
  volume={14},
  pages={104 - 55}
}

• B. Moszkowski
• Published 1 January 2004
• Computer Science
• Journal of Applied Non-Classical Logics

We present a completeness proof for Propositional Interval Temporal Logic (PITL) with finite time which avoids certain difficulties of conventional methods. It is more gradated than previous efforts since we progressively reduce reasoning within the original logic to simpler reasoning in sublogics. Furthermore, our approach benefits from being less constructive since it is able to invoke certain theorems about regular languages over finite words without the need to explicitly describe the associated intricate proofs. A modified version of regular expressions called Fusion Expressions is used as part of an intermediate logic called Fusion Logic. Both have the same expressiveness as PITL but are lower-level notations which play an important role in the hierarchical structure of the overall completeness proof. In particular, showing completeness for PITL is reduced to showing completeness for Fusion Logic. This in turn is shown to hold relative to completeness for conventional linear-time temporal logic with finite time. Logics based on regular languages over finite words and !-words offer a promising but elusive framework for formal specification and verification. A number of such logics and decision procedures have been proposed. In addition, various researchers have obtained complete axiom systems by embedding and expressing the decision procedures directly within the logics. The work described here contributes to this topic by showing how to exploit some interesting links between regular languages and interval-based temporal logics.