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

Theoretical Computer Science 160 (1-2):241-270 (1996)
Download Edit this record How to cite View on PhilPapers
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.
No keywords specified (fix it)
(categorize this paper)
PhilPapers/Archive ID
Upload history
Archival date: 2017-08-13
View other versions
Added to PP index

Total views
171 ( #28,263 of 55,977 )

Recent downloads (6 months)
32 ( #24,630 of 55,977 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.