Abstract
In this chapter we develop the calculus of boolean structures in a rather algebraic fashion. We do so for a variety of reasons. Firstly, we have to introduce the reader to the repertoire of general formulae that will be used throughout the remainder of this booklet. Secondly, by proving all formulae that have not been postulated, we give the reader the opportunity of gently familiarizing himself with our style of conducting such calculational proofs. Thirdly, we wish to present this material in a way that does justice to how we are going to use it. Since value-preserving transformations are at the heart of our calculus, so are the notions of equality and function application; hence our desire to develop this material with the equality relation in the central rôle. (It is here that our treatment radically departs from almost all introductions to formal logic: it is not uncommon to see the equality —in the form of “if and only if”— being introduced much later as a shorthand, almost as an afterthought.)
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this chapter
Cite this chapter
Dijkstra, E.W., Schölten, C.S. (1990). The calculus of boolean structures. In: Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3228-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3228-5_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7924-2
Online ISBN: 978-1-4612-3228-5
eBook Packages: Springer Book Archive