Abstract
We want to be able to describe sets of states of program variables and to write and manipulate clear, unambiguous assertions about program variables. We begin by considering only variables (and expressions) of type Boolean: from the operational point of view, each variable contains one of the values T and F, which represent our notions of “truth” and “falsity”, respectively. The word Boolean comes from the name of a 19th century English mathematician, George Boole, who initiated the algebraic study of truth values.
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
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Gries, D. (1981). Propositions. In: The Science of Programming. Text and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5983-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5983-1_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96480-5
Online ISBN: 978-1-4612-5983-1
eBook Packages: Springer Book Archive