Abstract
Boolean Theory, also known as logic, was designed as an aid to reasoning, and we will use it to reason about computation. The expressions of Boolean Theory are called boolean expressions. We divide boolean expressions into two classes; those in one class are called theorems, and those in the other are called antitheorems.
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
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Hehner, E.C.R. (1993). Basic Theories. In: A Practical Theory of Programming. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8596-5_1
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8596-5_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6444-6
Online ISBN: 978-1-4419-8596-5
eBook Packages: Springer Book Archive