Abstract
A new type of deductive principle (named the saturation one) is introduced for a complete class (called miniscoped) of the first order linear temporal logic with ⊗(”next”) and □(”always”). The saturation replaces induction-like postulates and intuitively corresponds to a certain type of regularity in the derivations for the logic. Non-logical axioms in ”saturated calculi” are some sequents, indicating the saturation of the derivation process in these calculi. The saturation suggests that ”nothing new” can be obtained continuing the derivation process. The non-logical axioms of the saturated calculus are constructed dependent on specific peculiarities of the given sequent. Therefore, for each given sequent (whose derivability requires the application of the induction-like postulate) a concrete saturated calculus is constructed. This property makes saturated calculi more effective than the traditional ones (based on the fixed induction-like postulate).
Preview
Unable to display preview. Download preview PDF.
References
H.Kawai: Sequential calculus for a first order infinitary temporal logic. Zeitshr. für Math. Logik und Grundlagen der Math. 33, 423–432 (1987).
S.Merz: Decidability and incompleteness results for first-order temporal logic of linear time. Journal of Applied Non-classical Logics 2, 139–156 (1992).
R.Pliuškevičius, Investigation of finitary calculi for temporal logics by means of infinitary calculi. In B.Rovan (ed.): Mathematical foundations of computer science 1990. Lecture Notes in Computer Science 452, Berlin: Springer 1990, pp.464–469.
R.Pliuškevičius: Completeness criterion for the Horn-like first order linear temporal logic. Proceedings of conference on applied logic. Logic at Work, Amsterdam 1992.
R.Pliuškevičius: On saturated calculi for a linear temporal logic, Proceedings of MFCS-93, Gdansk (in print).
R.Pliuškevičius: On the saturation principle for a linear temporal Logic. In Proceedings of KGC-93, Brno (in print).
T.Shimura: Cut-free systems for the modal logic S4.3 and S4.3GRZ. Reports on Mathematical Logic 25, 57–73 (1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pliuškevičius, R. (1993). Saturation replaces induction for a miniscoped linear temporal logic. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol 735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039716
Download citation
DOI: https://doi.org/10.1007/BFb0039716
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57316-6
Online ISBN: 978-3-540-48056-3
eBook Packages: Springer Book Archive