Completeness of a first-order temporal logic with time-gaps

Theoretical Computer Science 160 (1-2):241-270 (1996)
  Copy   BIBTEX

Abstract

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: the first is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Adding a temporal dimension to a logic system.Marcelo Finger & Dov M. Gabbay - 1992 - Journal of Logic, Language and Information 1 (3):203-233.
Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
Expressive completeness of temporal logic of trees.Bernd-Holger Schlingloff - 1992 - Journal of Applied Non-Classical Logics 2 (2):157-180.
Complexity of monodic guarded fragments over linear and real time.Ian Hodkinson - 2006 - Annals of Pure and Applied Logic 138 (1):94-125.
Naming worlds in modal and temporal logic.D. M. Gabbay & G. Malod - 2002 - Journal of Logic, Language and Information 11 (1):29-65.
The Unrestricted Combination of Temporal Logic Systems.Marcelo Finger & M. Weiss - 2002 - Logic Journal of the IGPL 10 (2):165-189.
An extended branching-time ockhamist temporal logic.Mark Brown & Valentin Goranko - 1999 - Journal of Logic, Language and Information 8 (2):143-166.

Analytics

Added to PP
2017-08-13

Downloads
386 (#51,864)

6 months
85 (#55,500)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Richard Zach
University of Calgary

References found in this work

No references found.

Add more references