Completeness of Neighbourhood Logic

Barua, Rana and Roy, Suman and Chaochen, Zhou (1999) Completeness of Neighbourhood Logic. [Book Chapter]

Preview

PDF Completeness.pdf Download (257kB)

Abstract

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.

Item Type:	Book Chapter
Publication:	STACS99: 16th Annual Symposium on Theoretical Aspects of Computer Science (Lecture Notes in Computer Science)
Publisher:	Springer Verlag Berlin
Additional Information:	Copyright for this article belongs to Springer Verlag Berlin.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	13 Dec 2006
Last Modified:	19 Sep 2010 04:15
URI:	http://eprints.iisc.ac.in/id/eprint/1730

Actions (login required)

View Item