You are here:  
4.2 Boolean logic
Presumably the 3 inputs is to a circuit but the circuit could consist of, say, just one gate, theoretically.

On this page: [ basics  truth tables  expressions ] Candidates need to know the basic operators and, or, not, nand, nor and xor, their symbols , how to express them in conventional notation and their truth tables (with a maximum of three inputs). Boolean expressions can also be written in words: (A xor not B)
You can be asked to construct Boolean expressions using the above operators, for example: This expression is equivalent to (A xor not B) and (C nor D). The value of a Boolean expression such as can be given in a truth table:
Complete the truth table for
Complete the truth table for the whole expression
related: [ Topic 4 home  next: Simplifying Boolean expressions ] 
About logic symbols, operators and truth tables. 


Questions or problems related to this web site should be addressed to Richard Jones who asserts his right to be identified as the author and owner of these materials  unless otherwise indicated. Please feel free to use the material presented here and to create links to it for noncommercial purposes; an acknowledgement of the source is required by the Creative Commons licence. Use of materials from this site is conditional upon your having read the additional terms of use on the about page and the Creative Commons Licence. View privacy policy. This work is licensed under a Creative Commons AttributionNonCommercialShareAlike 2.5 License. © 2001  2009 Richard Jones, PO BOX 246, Cambridge, New Zealand; This page was last modified: October 28, 2013 