Abstract
Dynamic logic has become a very useful tool in Computer Science, with direct applications in system specification. Here we show how to interpret first-order dynamic logic in an extension of the relational calculus of fork algebras. That is, reasoning in first-order dynamic logic can be replaced by equational reasoning in the extended relational calculus. This allows to: (a) incorporate the features of dynamic logic in a relational framework, and, (b) provide an equational calculus for reasoning in first-order dynamic logic.
Research Partially funded by Antorchas Foundation.
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
Burris, S. and Sankappanavar, H.P., A Course in Universal Algebra, Graduate Texts in Mathematics 78, Springer-Verlag, 1981.
Frias M. F., Baum G. A. and Haeberer A. M., Fork Algebras in Algebra, Logic and Computer Science, Fundamenta Informaticae Vol. 32 (1997), pp. 1–25.
Frias, M. F., Haeberer, A. M. and Veloso, P. A. S., A Finite Axiomatization for Fork Algebras, Logic Journal of the IGPL, Vol. 5, No. 3, 311–319, 1997.
Frias, M. F. and Orlowska E., Equational Reasoning in Non-Classical Logics, Journal of Applied Non Classical Logic, Vol. 8, No. 1–2, 1998.
Gyuris, V., A Short Proof for Representability of Fork Algebras, Theoretical Computer Science, vol. 188, 1–2, pp. 211–220, 1997.
Harel, D., Kozen, D. and Tiuryn, J., Dynamic Logic, MIT Press, 2000.
Henkin, L., Monk, D. and Tarski, A., Cylindric Algebras Part I, Studies in Logic and the Foundations of Mathematics, vol.64, North-Holland, 1971.
Henkin, L., Monk, D. and Tarski, A., Cylindric Algebras Part II, Studies in Logic and the Foundations of Mathematics, vol.115, North-Holland, 1985.
Lyndon, R., The Representation of Relational Algebras, Annals of Mathematics (Series 2) vol.51 (1950), 707–729.
Maddux, R.D., Topics in Relation Algebras, Doctoral Dissertation, Univ. California, Berkeley, 1978, pp. iii+241.
Maddux, R.D., Finitary Algebraic Logic, Zeitschr. f. math. Logik und Grundlagen d. Math. vol. 35, pp. 321–332, 1989.
Maddux, R.D., Pair-Dense Relation Algebras, Transactions of the A.M.S., vol. 328, No. 1, pp. 83–131, 1991.
Maddux, R.D., Relation Algebras, Chapter 2 of Relational Methods in Computer Science, Springer Wien-New York, 1997.
Orlowska, E., Relational proof systems for modal logics. In: Wansing, H. (ed) Proof Theory of Modal Logics. Kluwer, pp. 55–77, 1996.
Rasiowa, H. and Sikorski, R. The Mathematics of Metamathematics. Polish Science Publishers, Warsaw, 1963.
Tarski, A., On the Calculus of Relations, Journal of Symbolic Logic, Vol. 6, 73–89, 1941.
Tarski, A. and Givant, S., A Formalization of Set Theory without Variables, A.M.S. Coll. Pub., vol. 41, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frias, M.F., Baum, G.A., Maibaum, T.S.E. (2002). Interpretability of First—Order Dynamic Logic in a Relational Calculus. In: de Swart, H.C.M. (eds) Relational Methods in Computer Science. RelMiCS 2001. Lecture Notes in Computer Science, vol 2561. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36280-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-36280-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00315-1
Online ISBN: 978-3-540-36280-7
eBook Packages: Springer Book Archive