COMPSCI 1JC3 Lecture Notes - Lecture 4: George Boole, Boolean Function

• School: McMaster University
• Department: Computer Science
• Course: COMPSCI 1JC3
• Professor: William Farmer

Document Summary

Boolean are a standard truth value either true or false. Discovered that true and false can be computed and reasoned with in a similar nature to numbers. Boolean expressions are denoted by the value true or false. Discovered an algebra of truth values called boolean algebra. Boolean expressions (also called a formula) is an expression of type bool. Has the type of bool -> bool -> bool. Meanings can be derived from truth tables. All boolean functions can be constructed using just. The meaning of the boolean function implies is given by the following truth table. Which of the following boolean expressions is equivalent to (b1 implies b2)? (not b1) and (not b2) (not b1) or (not b2) B: (not b1) and b2, (not b1) or b2, not(b1 and (not b)) Have to make truth tables for each and check with the truth table for implies. For e we don"t need truth tables because we can use demorgan laws.