Abstract
This paper will present a natural deduction system of temporal logic, which includes two collections of inference rules called “horizontal inference rules” and “vertical inference rules” respectively. It is also proved that the system is both sound and complete under an appropriate interpretation. Very natural and generally short, each proof in the system can be represented by a matrix whose entries serve to record the inference process.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Abadi, Z. Manna, Nonclausal Temporal Deduction, LNCS 193, Springer-Verlag, 1985.
H. Barringer, R. Kuiper, A. Pnueli, Now You May Compose Temporal Logic Specification, Proc. 16th ACM Symposium on the Theory of Computing, Washington, 1984.
M. Ben-Ari, Z. Manna, A. Pnuell, The Temporal logic of branching time,Acta Informatica,20(1983), 207–226.
E.M. Clarke, E.A. Emerson, A.P. Sistla, Automatic verification of finite-ctate concurrent system using temporal logic specification,ACM Trans. Programming Languages and Systems,8:2 (1986).
E.A. Emerson, J. Y. Halpern, “Sometimes” and “Not Never” revisited: on branching versus linear time temporal logic,J. ACM,33:1(1986).
G. E. Hughes, M. J. Gresswell, An Introduction To Modal Logic, Methuen and co. Ltd. 1968.
C. H. Kung, A Temporal Framework for Database Specification and Verification, Proc. of 10th International Conf. on VLDB, Singapore, 1984.
F. Kroger, On temporal program verification rules,Theoretical Informatics,19:3(1985).
F. Kroger, Temporal Logic of Programs, Springer-Verlag, 1987.
L. Lamport, “Sometimes” is sometimes “Not Never”—on the Temporal Logic of Programs, Proc. 7th ACM Symp. Principles of Programming Languages, 1980.
Z. Manna, Verification of sequential programs: Temporal axiomatization, in Theoretical Foundation of Programming Methodology, 1982.
Z. Manna, A. Pnueli, Verification of concurrent programs: the temporal framework, in Correctness Problem in Computer Science (R. S. Boyer & J. S. Moore, eds), International Lecture Series in Computer Science, Academic Press, London, 1981.
Z. Manna, A. Pnueli, Verification of concurrent programs: Temporal proof principles, in Logic of Programs, LNCS 131, Springer-Verlag, 1982.
R. P. McArthur, Tense Logic, D. Reidel Publishing Company, 1976.
S. Owicki, L. Lamport, Proving liveness properties of concurrent programs,ACM TOPLAS,4:3 (1982).
A. Pnueli, The Temporal Logic of Programs, 18th IEEE Symposium on Foundation of Computer Science, 1977.
A. Pnueli, The temporal semantics of concurrent programs,Theoretical Computer Science,13 (1981), 45–60.
N. Reacher, A. Urquart, Temporal Logic, Springer-Verlag, 1971.
A. Szalas, Concerning the semantic consequence relation in first-order temporal logic,Theoretic Computer Science,47:3(1987).
C. S. Tang, XYZ: A program development environment based on temporal logic, Programming Languages and System Design (ed. J. Bormann), 1983.
P. Wolper, Temporal logic can be more expressive, 22nd Annual Symposium on Foundation of Computer Science, 1981.
Author information
Authors and Affiliations
Additional information
This research was supported by National Foundation of Natural Science.
Rights and permissions
About this article
Cite this article
Li, R. A natural deduction system of temporal logic. J. of Comput. Sci. & Technol. 3, 173–185 (1988). https://doi.org/10.1007/BF02943343
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943343