Labelled natural deduction for a bundled branching temporal logic

We give a sound and complete labelled natural deduction system for a bundled branching temporal logic, namely the until-free version of BCTL*. The logic BCTL* is obtained by referring to a more general semantics than that of CTL*, where we only require that the set of paths in a model is closed under taking suffixes (i.e. is suffix-closed) and is closed under putting together a finite prefix of one path with the suffix of any other path beginning at the same state where the prefix ends (i.e. is fusion-closed). In other words, this logic does not enjoy the so-called limit-closure property of the standard CTL* validity semantics. We give both a classical and an intuitionistic version of our labelled natural deduction system for the until-free version of BCTL*, and carry out a proof-theoretical analysis of the intuitionistic system: we prove that derivations reduce to a normal form, which allows us to give a purely syntactical proof of consistency (for both the intuitionistic and classical versions) of the deduction system.

[1]  A. Prasad Sistla,et al.  Deciding Full Branching Time Logic , 1985, Inf. Control..

[2]  Stefano Baratella,et al.  A proof-theoretic investigation of a logic of positions , 2003, Ann. Pure Appl. Log..

[3]  Rajeev Goré,et al.  Tableau Methods for Modal and Temporal Logics , 1999 .

[4]  S. Martini,et al.  A Computational Interpretation of Modal Proofs , 1996 .

[5]  Frank Pfenning,et al.  Logical Frameworks , 2001, Handbook of Automated Reasoning.

[6]  R. Thomason.  Combinations of Tense and Modality , 2002 .

[7]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Krysia Broda,et al.  Labelled Natural Deduction for Conditional Logics of Normality , 2002, Log. J. IGPL.

[9]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[10]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[12]  Jan Chomicki,et al.  Temporal Logic in Information Systems , 1998, Logics for Databases and Information Systems.

[13]  Alberto Zanardo,et al.  Branching-time logic with quantification over branches: The point of view of modal logic , 1996, Journal of Symbolic Logic.

[14]  Luca Viganò,et al.  A History of Until , 2009, M4M.

[15]  E. Allen Emerson,et al.  Alternative Semantics for Temporal Logics , 1981, Theor. Comput. Sci..

[16]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[17]  Zohar Manna,et al.  Completing the Temporal Picture , 1991, Theor. Comput. Sci..

[18]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[19]  Mark Reynolds,et al.  An axiomatization of full Computation Tree Logic , 2001, Journal of Symbolic Logic.

[20]  Alexander Bolotov,et al.  Natural Deduction Calculus for Computation Tree Logic , 2006, IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06).

[21]  Pierre Wolper,et al.  Reasoning about fair concurrent programs , 1986, STOC '86.

[22]  Stefano Baratella,et al.  An approach to infinitary temporal proof theory , 2004, Arch. Math. Log..

[23]  Pierre Wolper,et al.  The tableau method for temporal logic: an overview , 1985 .

[24]  Mark Reynolds,et al.  A Tableau for Bundled CTL , 2006, J. Log. Comput..

[25]  Mark Reynolds,et al.  An axiomatization of PCTL* , 2005, Inf. Comput..

[26]  Dov M. Gabbay,et al.  A Sound and Complete Deductive System for CTL* Verification , 2008, Log. J. IGPL.

[27]  Alessandra Russo,et al.  Generalising Propositional Modal Logic Using Labelled Deductive Systems , 1996, FroCoS.

[28]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .