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

Theoretical Computer Science

Volumn 160, Issue 1-2, 1996, Pages 241-270

  Baaz, Matthias ^a   Leitsch, Alexander ^a   Zach, Richard ^a,b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; MATHEMATICAL OPERATORS; THEOREM PROVING;

COMPLETENESS; FIRST ORDER TEMPORAL LOGIC; SEMANTICS;

FORMAL LOGIC;

EID: 0345983355     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00107-7     Document Type: Article

References (15)

1. H. Andreká, V. Goranko, S. Mikulás, I. Németi and I. Sain, Effective Temporal Logic of Programs, in: L. Bole and A. Szalas, eds., Time and Logic. A Computational Approach (UCL Press, London, 1995) 51-129.
2. M. Baaz, An effective decision algorithm for propositional temporal logic, in: 5. Österreichische Artificial-Intelligence-Tagung, Informatik-Fachber. 208 (Springer, Berlin, 1989).
3. J.R. Büchi, On a decision method in restricted second order arithmetic, in: Logic, Methodology and Philosophy of Science. Proc. 1960 Congress (Stanford University Press, Stanford, 1962) 1-11.
4. M. Fitting, Proof Methods for Modal and Intuitionistic Logics, Synthese Library, Vol. 169 (Reidel, Dordrecht, 1983).
5. P. Kremer, Quantifying over propositions in relevance logic: Non-axiomatisability of primary interpretations of ∀p and ∃p, J. Symbolic Logic 58 (1993) 334-349.
6. S.A. Kripke, The undecidability of monadic modal quantification theory, Z. Math. Logik Grundlag. Math. 8 (1962) 113-116.
7. F. Kröger, Temporal Logic of Programs, EATCS Monographs in Computer Science, Vol. 8 (Springer, Berlin, 1987).
8. F. Kröger, On the interpretability of arithmetic in temporal logic, Theoret. Comput. Sci. 73 (1990) 47-60.
9. Y.S. Maslov, Inverse method of establishing deducibility, Trudy Mat. Inst. Steklov (1968) 26-87.
10. G.E. Mints, Gentzen-type systems and resolution rules. Part I: Propositional logic, in: COLOG-88. Proc. Internat. Conf. on Computer Logic, Lecture Notes in Computer Science, Vol. 417 (Springer, Berlin, 1990) 198-231.
11. G.E. Mints, Gentzen-type systems and resolution rules. Part II: Predicate logic, in: Logic Colloquium 1990, Lecture Notes in Logic, Vol. 2 (Springer, Berlin, 1993).
12. A. Szalas, Concerning the semantic consequence relation in first-order temporal logic, Theoret. Comput. Sci. 47 (1986) 329-334.
13. A. Szalas and L. Holenderski, Incompleteness of first-order temporal logic with until, Theoret. Comput. Sci. 57 (1988) 317-325.
14. G. Takeuti, Proof Theory, Studies in Logic, Vol. 81. (North-Holland, Amsterdam, 2nd ed., 1987).
15. T. Tammet, Proof strategies in linear logic, J. Automat. Reason. 12 (1994) 273-304.