Abstract
First we describe a certain branching time logic. We borrow this logic from Prior (1967) and call it BTL. It is a propositional logic whose formulas are built from propositional symbols by means of usual boolean connectives and additional unary connectives PAST, FUTURE, NECESSARY.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported in part by NSF grant MCS83-01022.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gurevich, Y., and Shelah, S., 1984, The Decision Problem for Branching Time Logic, J. Symbolic Logic, to appear.
Prior, A. N., 1967, “Past, Present and Future,” Clarendon Press, Oxford.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gurevich, Y., Shelah, S. (1985). To the Decision Problem for Branching Time Logic. In: Dorn, G., Weingartner, P. (eds) Foundations of Logic and Linguistics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0548-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4899-0548-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-0550-5
Online ISBN: 978-1-4899-0548-2
eBook Packages: Springer Book Archive