Simplification by Truth Table and without Truth Table PCNF ...

Engineering MathematicsSUBJECT NAMESUBJECT CODEMATERIAL NAMEMATERIAL CODEREGULATIONUPDATED ON: Discrete Mathematics: MA2265: University Questions: SKMA1006: R2008: August 20132013 Name of the Student:Unit I (Logic and Proofs)Branch: Simplification by Truth Table and without Truth that p (q r ) and ( p q ) ( p r ) are logically equivalent. (N/D 2012) without using the Truth Table , prove that p ( q r ) q ( p r ) .(N/D 2010) that ( P Q ) ( R Q ) ( P R) Q .(M/J 2013) PCNF and using Truth Table find the PCNF and PDNF ofP ( Q P ) ( P ( Q R ) ) .(A/M 2011) the principal disjunctive normal form of the statement,(q ( p r )) (( p r ) q) .(N/D 2012) the principal disjunctive normal form and principal conjunction form ofthe statement p p ( q ( q r ) ) .()(N/D 2010) that ( P R ) ( Q P ) = ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ).

• Simplification by Truth Table and without Truth Table 1. 2. Show that p ∨ (q ∧ r ) and ( p ∨ q ) ∧ ( p ∨ r ) are logically equivalent. (N/D 2012) Without using the truth table, prove that ¬p → ( q → r ) ≡ q → ( p ∨ r ) . (N/D 2010) 3. Prove that ( P → Q ) ∧ ( R → Q ) …

Loading..

Tags:

  Simplification

Information

Related search queries