Abstract
Proposition algebra is based on Hoare’s conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is based on evaluation trees and that characterizes so-called free valuation congruence: two conditional statements are free valuation congruent if, and only if, they have equal evaluation trees. Free valuation congruence is axiomatized by the four basic equational axioms of proposition algebra that define the conditional connective. A valuation congruence that is axiomatized in proposition algebra and that identifies more conditional statements than free valuation congruence is repetition-proof valuation congruence, which we characterize by a simple transformation on evaluation trees.
Keywords
- Conditional composition
- Evaluation tree
- Proposition algebra
- Short-circuit evaluation
- Short-circuit logic
Dedicated to Ernst-Rüdiger Olderog on the occasion of his sixtieth birthday. Jan Bergstra recalls many discussions during various meetings as well as joint work with Ernst-Rüdiger and Jan Willem Klop on readies, failures, and chaos back in 1987. Alban Ponse has pleasant memories of the process of publishing [8], the Selected Papers from the Workshop on Assertional Methods, of which Ernst-Rüdiger, who was one of the invited speakers at this workshop (held at CWI in November 1992), is one of the guest editors. An extended version of this paper appeared as report [6].
This is a preview of subscription content, access via your 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
Bergstra, J.A., Bethke, I., Rodenburg, P.H.: A propositional logic with 4 values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics 5(2), 199–218 (1995)
Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming 51(2), 125–156 (2002)
Bergstra, J.A., Ponse, A.: On Hoare-McCarthy algebras [cs.LO] (2010). http://arxiv.org/abs/1012.5059
Bergstra, J.A., Ponse, A.: Proposition algebra. ACM Transactions on Computational Logic 12(3), Article 21, 36 pages (2011)
Bergstra, J.A., Ponse, A.: Proposition algebra and short-circuit logic. In: Arbab, F., Sirjani, M. (eds.) FSEN 2011. LNCS, vol. 7141, pp. 15–31. Springer, Heidelberg (2012)
Bergstra, J.A., Ponse A.: Evaluation trees for proposition algebra. arXiv:1504.08321v2 [cs.LO] (2015)
Bergstra, J.A., Ponse, A., Staudt, D.J.C.: Short-circuit logic. arXiv:1010.3674v4 [cs.LO, math.LO] (version v1: October 2010) (2013)
de Boer, F.S., de Vries, F.-J., Olderog, E.-R., Ponse, A. (guest editors): Selected papers from the Workshop on Assertional Methods. Formal Aspects of Computing, 6(1 Supplement; Special issue) (1994)
Harel, D.: Dynamic logic. In: Gabbay, D., Günthner, F. (eds.) Handbook of Philosophical Logic, vol. II, pp. 497–604. Reidel Publishing Company (1984)
Hayes, I.J., He Jifeng, Hoare, C.A.R., Morgan, C.C., Roscoe, A.W., Sanders, J.W., Sorensen, I.H., Spivey, J.M., Sufrin B.A.: Laws of programming. Communications of the ACM 3(8), 672–686 (1987)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International (1985)
Hoare, C.A.R.: A couple of novelties in the propositional calculus. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 31(2), 173–178 (1985); Republished. In: Hoare, C.A.R., Jones, C.B. (eds.) Essays in Computing Science. Series in Computer Science, pp. 325–331. Prentice Hall International (1989)
Staudt, D.J.C.: Completeness for two left-sequential logics. MSc. thesis Logic, University of Amsterdam (May 2012). arXiv:1206.1936v1 [cs.LO] (2012)
Wortel, L.: Side effects in steering fragments. MSc. thesis Logic, University of Amsterdam (September 2011). arXiv:1109.2222v1 [cs.LO] (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bergstra, J.A., Ponse, A. (2015). Evaluation Trees for Proposition Algebra. In: Meyer, R., Platzer, A., Wehrheim, H. (eds) Correct System Design. Lecture Notes in Computer Science(), vol 9360. Springer, Cham. https://doi.org/10.1007/978-3-319-23506-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-23506-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23505-9
Online ISBN: 978-3-319-23506-6
eBook Packages: Computer ScienceComputer Science (R0)