Abstract
This chapter offers an alternative to the widely-held view that boolean expressions are defined by how they are evaluated. Here, expressions are defined in terms of how they can be manipulated. Our goals are to convey a sense of how one manipulates boolean expressions and to teach heuristics and principles for developing proofs. By working out the exercises, the reader can develop a manipulative skill that will prove valuable in later work.
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
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gries, D., Schneider, F.B. (1993). Propositional Calculus. In: A Logical Approach to Discrete Math. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3837-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3837-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2835-1
Online ISBN: 978-1-4757-3837-7
eBook Packages: Springer Book Archive