Logic Algebra Problems: Solving Identities and Verifying Tautologies - Prof. Margaret P. M, Assignments of Discrete Mathematics

A list of logic algebra problems aimed at proving identities using logical operators and verifying tautologies. The problems involve using de morgan's laws, distributive laws, and other logical rules to simplify complex expressions. Students of mathematics, particularly those studying logic and algebra, will find this document useful for practicing problem-solving skills and deepening their understanding of logical operations.

Typology: Assignments

Pre 2010

Uploaded on 02/13/2009

koofers-user-3q7
koofers-user-3q7 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 2534 Logic Algebra Problems:
Using Logic Algebra, Prove the Following identities:
1) (PQ) (PQ) (P∧∼Q) QP
2) (PQR) ( P∧∼QR) (P∧∼Q∧∼R) ()PR Q
3) [(PQ) (P∨∼R)] (P∨∼Q) PR
∼∼
4) (RP) [(R (PQ) ) (RQ)] PQ
5) [(PQ) (P∧∼Q)] (PQ) P
Use Algebra of Logic to verify that the following is a tautology
6) [ P (P Q) (QR)] R T
Express the following expression in terms of the Nand operator.
7) P ( QR)
Simplify each statement below:
8) P(Q R)
9) (P (Q R)) (Q P)
Negate each statement and simplify
10) P(Q R)
11) (P (Q R)) (Q P)

Partial preview of the text

Download Logic Algebra Problems: Solving Identities and Verifying Tautologies - Prof. Margaret P. M and more Assignments Discrete Mathematics in PDF only on Docsity!

Math 2534 Logic Algebra Problems:

Using Logic Algebra, Prove the Following identities:

  1. (P∧Q) ∨ (∼P∧Q) ∨ (∼P∧∼Q) ≡ Q ∨ ∼ P

  2. (P∧Q∧R) ∨ ( P∧∼Q∧R) ∨ (P∧∼Q∧∼R) ≡ P ∧ ( R ∨ ∼ Q )

  3. [(∼P∨Q) ∧ (P∨∼R)] ∧ (∼P∨∼Q) ≡ ∼ P ∧∼ R

  4. (R∨P) ∧ [(∼R∨ (P∧Q) ) ∧ (R∨Q)] ≡ PQ

  5. ∼[(∼P∧Q) ∨ (∼P∧∼Q)] ∨ (P∧Q) ≡ P

Use Algebra of Logic to verify that the following is a tautology

  1. [ P∧ (P→ Q) ∧(∼Q∨R)] → R ≡ T

Express the following expression in terms of the Nand operator.

  1. P∧ (∼ Q∨R)

Simplify each statement below:

  1. P→(Q →R)
  2. (P∧ (Q→ R)) ∨ (∼Q ∧P)

Negate each statement and simplify

  1. P→(Q →R)
  2. (P∧ (Q→ R)) ∨ (∼Q ∧P)