An Axiomatization of a First-order Branching Time Temporal Logic

We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomati- zation for the considered logic.

[1]  Andrzej Szalas,et al.  Incompleteness of First-Order Temporal Logic with Until , 1988, Theor. Comput. Sci..

[2]  John P. Burgess,et al.  Basic Tense Logic , 1984 .

[3]  E. Allen Emerson,et al.  Automated Temporal Reasoning about Reactive Systems , 1996, Banff Higher Order Workshop.

[4]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[5]  Martín Abadi,et al.  The Power of Temporal Proofs , 1989, Theor. Comput. Sci..

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

[7]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

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

[9]  Peter Øhrstrøm,et al.  Temporal Logic , 1994, Lecture Notes in Computer Science.

[10]  Roope Koivola.  Axiomatising Extended Computation Tree Logic , 1996 .

[11]  Roope Kaivola.  Axiomatising Extended Computation Tree Logic , 1996, CAAP.

[12]  Miodrag Raskovic,et al.  Some first-order probability logics , 2000, Theor. Comput. Sci..

[13]  Ildikó Sain,et al.  Completeness Problems in Verification of Programs and Program Schemes , 1979, MFCS.

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

[15]  Johan van Benthem,et al.  The Logic of Time , 1983 .

[16]  Jaakko Hintikka,et al.  Time And Modality , 1958 .

[17]  Fred Kröger,et al.  On the Interpretability of Arithmetic in Temporal Logic , 1990, Theor. Comput. Sci..

[18]  Amir Pnueli,et al.  Propositional Temporal Logics: Decidability and Completeness , 2000, Log. J. IGPL.

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

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

[21]  John P. Burgess,et al.  Axioms for tense logic. I. "Since" and "until" , 1982, Notre Dame J. Formal Log..

[22]  Ildikó Sain,et al.  On the Strength of Temporal Proofs , 1989, MFCS.

[23]  Andrzej Szalas,et al.  A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time , 1987, Theor. Comput. Sci..

[24]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

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

[26]  Zoran Ognjanovic.  Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity , 2006, J. Log. Comput..

[27]  Moshe Y. Vardi.  Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.