Completeness of a first-order temporal logic with time-gaps
- 10 June 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 160 (1-2) , 241-270
- https://doi.org/10.1016/0304-3975(95)00107-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Gentzen-type systems and resolution rule. Part II. Predicate logicPublished by Cambridge University Press (CUP) ,2017
- Proof strategies in linear logicJournal of Automated Reasoning, 1994
- QUANTIFYING OVER PROPOSITIONS IN RELEVANCE LOGIC - NONAXIOMATISABILITY OF PRIMARY INTERPRETATIONS OF FOR-ALL-P AND THERE-EXISTS-PThe Journal of Symbolic Logic, 1993
- On the interpretability of arithmetic in temporal logicTheoretical Computer Science, 1990
- Incompleteness of first-order temporal logic with untilTheoretical Computer Science, 1988
- Temporal Logic of ProgramsPublished by Springer Nature ,1987
- Concerning the semantic consequence relation in first-order temporal logicTheoretical Computer Science, 1986
- Proof Methods for Modal and Intuitionistic LogicsPublished by Springer Nature ,1983
- Symposium on Decision Problems: On a Decision Method in Restricted Second Order ArithmeticPublished by Elsevier ,1966
- The Undecidability of Monadic Modal Quantification TheoryMathematical Logic Quarterly, 1962