This chapter describes truth conditions for atomic statements, quantified statements, and compound statements with one connective. It concludes with several computing related applications. After studying this chapter you should be able to:
-
1.
Use the truth conditions for the basic truth functional connectives to determine the truth value of a statement involving at most a single truth functional connective, given the truth values of its component parts.
-
2.
Understand the effect of short cut evaluation of “and” and “or” in programs, and determine when they are being used.
-
3.
Calculate using bitwise extensions of “not,” “and,” “or,” and “xor.”
-
4.
Apply bitwise extensions of truth functions to make and use masks and simple codes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
Lover, R. (2008). Truth for Statements with at Most One Connective. In: Elementary Logic. Springer, London. https://doi.org/10.1007/978-1-84800-082-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-84800-082-7_8
Publisher Name: Springer, London
Print ISBN: 978-1-84800-081-0
Online ISBN: 978-1-84800-082-7
eBook Packages: Computer ScienceComputer Science (R0)