Abstract
The paper provides a decision algorithm for Kröger’s temporal propositional logic based on the construction of “finite” counterexamples defined by finite graphs, where each node may represent different but equivalent stages of the infinite time line. The paper characterizes the operations definable in the logic, i. e. its strength.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Büchi J.R.: On a decision method in restricted second order arithmetic,in-Logic, Methodology and Philosophy of Science,Proceedings of the1960 congress. pp 1–11,1 962
Kröger.F.: Temporal logic of programs,EATCS Monographs on Theoretical Computer Science 8, 1987
Meyer,A.R.: The inherent complexity of theories of ordered sets,in: Proceedings of the international Congress of Mathematics. Vancouver 1974 /2 pp 477–482,1975
Rabin.M.O.: Decidable theories, in:The handbook of mathematical logic,ed:Barwise, pp.595–630, 1977
Schlingloff,H.:Beweistheoretische Untersuchungen zur temporalen Logik, Diplomarbeit, Techn.Univ.Munich 1983
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baaz, M. (1989). An effective decision algorithm for prepositional temporal logic. In: Retti, J., Leidlmair, K. (eds) 5. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74688-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-74688-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51039-0
Online ISBN: 978-3-642-74688-8
eBook Packages: Springer Book Archive