Completeness of Neighbourhood Logic

This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of liveness and fairness properties of computing systems as well as formalisation of many concepts of real analysis. These two modalities are also adequate in the sense that they can derive other important unary and binary modalities of interval temporal logic. We prove the completeness result for NL by giving a Kripke model semantics and then mapping the Kripke models to the interval models for NL.

• Type: Conference
• Year: 1999
• Where: STACS
• Authors: Rana Barua, Suman Roy, Zhou Chaochen
• Keywords: Interval Temporal Logic, Kripke Models, Neighbourhood Modalities, STACS 1999, Theoretical Computer Science