Abstract
We consider a first order temporal logic of linear discrete time with temporal modalities ○ (“next”), D (“always in the future”) which includes equality, time-dependant predicate as well as time-dependant function symbols. It is known that this logic is not finitary axiomatizable. We present an infinite cut-free Gentzen-style calculus for the logic. The inference rules for equality which have no counterparts in sequent calculi for first order predicate logic with equality are introduced. Soundness and completeness are proved for the calculus.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.Abadi, The power of temporal proofs, Theoret. Comput. Sci. 65 (1989), 35–83.
H.Andreka, I.Nemeti, I.Sain, On the strength of temporal proofs, Proc. Conf. MFCS'89, LNCS 379, Springer Verlag, Berlin (1989), 135–144.
J.H.Gallier, Logic for computer science, Harper & Row Publishers, New York, (1986).
J.W.Garson, Quantification in modal logic in: D. Gabbay and F.Guenthner (eds.), Handbook of Philosophical Logics II, D.Reidel Publishing Company, (1984), 249–309.
S.Kanger, A simplified proof method for elementary logic, Computer Programming and Formal Systems, North-Holland, Amsterdam (1963), 87–94.
H.Kawai, Sequential calculus for a first order infinitary temporal logic, Zeitschr. f. math. Logic und Grundlagen d.Math. 33 (1987), 423–432.
F.Kröger, LAR: a logic for algorithmic reasoning about programs, Acta Informatica 8 (1977), 242–260.
V.A.Lifshitz, Specialization of the form of deduction in the predicate calculus with equality and function symbols, Proc. Steklov Inst. Math. 98 (1968), 1–24.
Z.Manna, A.Pnueli, How to cook a temporal proof system for your pet language, in: Proc. Tenth ACM Symp. on Principles of Programming Languages (1983), 141–154.
G.Mirkowska, A. Salwicki, Algorithmic logic, D. Reidel Publishing Company (1987), 56–64.
R.Pliuškevičius, Investigation of finitary calculus for a discrete linear time logic by means of finitary calculus, LNCS 502, Springer Verlag, Berlin (1991) 504–528.
A.Szalas, A complete axiomatic characterization of first-order temporal logic of linear time, Theoretical Comp. Sci. 54 (1987), 199–214.
M.E.Szabo, A sequent calculus for Kröger's logic, LNCS 148, Springer Verlag, Berlin (1983) 295–303.
G.Takeuti, Proof theory, North-Holland (1975).
S.C.Kleene, Mathematical logic, John Wiley & Sons, Inc., New York (1967).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakalauskaite, J. (1992). A sequent calculus for a first order linear temporal logic with equality. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023895
Download citation
DOI: https://doi.org/10.1007/BFb0023895
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55707-4
Online ISBN: 978-3-540-47276-6
eBook Packages: Springer Book Archive