Skip Navigation

Journal of Logic and Computation 1993 3(3):249-268; doi:10.1093/logcom/3.3.249
© 1993 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by ZANARDO, A.
Right arrow Articles by CARMO, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL

ALBERTO ZANARDO and JOSÉ CARMO

Dipartimento di Matematica Pura ed Applicata Via Belzoni 7, 1-35131 Padova, Italy
Departamento de Matematica, IST Av Rovisco Pais, P-1096 Lisboa, Portugal

The framework underlying CTL* is extended in order to include past operators. Recent developments in areas related to concurrent program specification and verification, as well as database and information systems specification, justify the interest of such extension. The semantics for the language so obtained is defined according to the ockhamist approach to non-deterministic time. The differences between this semantics and the original semantics for CTL* are analysed. A sound axiomatization is proposed for such logic and its completeness is proved.

Keywords: Computational logic; branching-time logic; completeness.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.