Skip Navigation



Journal of Logic and Computation Advance Access published online on September 16, 2006
Journal of Logic and Computation, doi:10.1093/logcom/exl033
This Article
Right arrow Full Text (Rapid PDF)
Right arrow All Versions of this Article:
17/1/117    most recent
exl033v1
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 Reynolds, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received April 3, 2006

Original Papers

A Tableau for Bundled CTL*

Mark Reynolds 1 *

1 School of Computer Science & Software Engineering, The University of Western Australia, M002, 35 Stirling Highway, Crawley, W.A. 6009, Australia

* To whom correspondence should be addressed.
Mark Reynolds, E-mail: mark{at}csse.uwa.edu.au


  Abstract

We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching-time temporal logic. However, the main interest in this should be that it leads us closer to being able to devise a tableau-based technique for theorem-proving in the important full computational tree logic CTL*.

Keywords: Temporal logic; branching-time logic; tableau; full computation tree logic; theorem proving.
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.