Oxford Journals
tools journals homepage advanced search contact help
Journal of Logic and Computation: Current Issue
 
home
browse
current
etoc
authors
subinfo
subscribers
samples

OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation

Journal of Logic and Computation

Volume 12, Issue 4, August 2002: pp. 641-677

Extending Kamp's Theorem to Model Time Granularity

Angelo Montanari1, Adriano Peron2 and Alberto Policriti3

1Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100 Udine, Italy. E-mail: montana@dimi.uniud.it
2Dipartimento di Scienze Fisiche, Università di Napoli Federico II, Via Cintia, 80126 Napoli, Italy. E-mail: peron@na.infn.it
3Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100 Udine, Italy. E-mail: policrit@dimi.uniud.it

In this paper, a generalization of Kamp's theorem relative to the functional completeness of the until operator is proved. Such a generalization consists in showing the functional completeness of more expressive temporal operators with respect to the extension of the first-order theory of linear orders MFO[<] with an extra binary relational symbol. The result is motivated by the search of a modal language capable of expressing properties and operators suitable to model time granularity in [ohgr]-layered temporal structures.

Keywords: Kamp's theorem; linear temporal logic; functional completeness; time granularity

Table of Contents   Full-Text PDF (479 KB)

Oxford University Press
Published by Oxford University Press
Copyright ©Oxford University Press 2003
Print ISSN: 0955-792X  Online ISSN: 1465-363X.
Oxford University Press Privacy Policy and Legal Statement