lec8.ppt.pptVIP

Oct. 1, 2001 Systems Architecture I September 4, 1997 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to codify logical statements and to reason about these statements. To illustrate how a computer can be used to carry out formal proofs and to provide a framework for logical deduction. Topics Boolean functions and expressions Rules of Boolean Algebra Logic Minimization Tautologies and automatic verification of tautologies Application to Circuit Design Programming Example Boolean expressions arise in conditional statements. It is possible to abstract the relations with boolean variables (propositions that are either true or false). Using this abstraction one can reason and simplify conditional statements. if ((a b) || ((a = b) (c == d)) then { … } else { … } Let p denote the relation (ab) and q denote the relation (c == d). The above expression is then equal to p || !p q Programming Example (cont) The previous expression is equivalent (two expressions are equivalent if they are true for the same values of the variables occurring in the expressions) to a simpler expression (p || !p q) ? p || q We can see this since if p is true both expressions are true, and if p is false, then !p is true and (!p q) is true exactly when q is true. Limitations of Propositional Calculus Propositions hide the information in the predicates they abstract. Sometimes properties of the hidden information is required to make further deductions. E.G. for integers a,b, and c, (a b) (b c) implies that a c; however, this can not be deduced without using the order properties of the integers. The predicate calculus allows the use of predicates to encode this additional information. E.G. we can introduce a parameterized predicate lt(a,b) to encode the predicate a b. Properties such as lt(a,b) lt(b,c) ? lt(a,c) can be asserted. This type of notation and deduction is discussed in chapte