UPDF AI

Completeness of a First-Order Temporal Logic with Time-Gaps

M. Baaz,A. Leitsch,R. Zach

1996 · DOI: 10.1016/0304-3975(95)00107-7
Theoretical Computer Science · 29 Citations

TLDR

The first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete linear time) and trees of ω-segments (linear time with branching gaps) and some of its fragments are compared and a cut-free complete sequent calculus is given.