Abstract
The proofs in this book are much more calculational than we were used to only a few years ago. As we shall explain later, the theorems are (or could be) formulated as boolean expressions, for which, in principle, true and false are the possible values; the proofs consist in calculations evaluating these boolean expressions to true. We shall return to this later, focussing, for the time being, our attention on some of the notational consequences of this approach.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Dijkstra, E.W., Schotten, C.S. (1990). On 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_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3228-5_1
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