Scribd
Upload
10 views

Module 1 Imp

This document contains examples of problems involving tautologies, logically equivalent statements, truth tables, and independence of components. The examples cover proving tautologies using laws of logic, showing logical equivalence with and without truth tables, finding possible truth values based on given information, and determining independence of components.

Uploaded by

BHAVANA BIDARKAR
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

Module 1 Imp

This document contains examples of problems involving tautologies, logically equivalent statements, truth tables, and independence of components. The examples cover proving tautologies using laws of logic, showing logical equivalence with and without truth tables, finding possible truth values based on given information, and determining independence of components.

Uploaded by

BHAVANA BIDARKAR
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

mODULE 1

1. Problems on TAUTOLOGY, CONTRADICTION, CONTINGENCY:

Examples:

(1) Prove that, for any propositions p, q, r , the compound propositions, are tautologies.

i) {( → ) ∧ ( → )} → {( → )} ii) { → ( → )} → {( → ) → ( → )}

(2) Determine whether the following statement is tautology or not.

( → ( ∨ )) ↔ (( ∧¬ )→ )

2. Problems on LOGICALLY EQUIVALENT STATEMENTS: (using truth tables)

Examples:

(1) By constructing the truth table, show that the compound propositions ∧ (¬ ∨ )

and ∨ ( ∧ ¬ ) are not logically equivalent.

(2) Use truth tables to verify,

(i) [ → ( ∧ ) ⟺ ( → ) ∧ ( → ) (ii) [( ∨ ) → ] ⟺ [( → ) ∧ ( → )]

(iii) [( ↔ ) ∧ ( ↔ ) ∧ ( ↔ )] ⟺ [( → ) ∧ ( → ) ∧ ( → )]

3. Problems on LOGICALLY EQUIVALENT STATEMENT USING Laws of Logic:

Examples:

(1) Define logical equivalence of two propositions. Prove the following logical equivalences

without using the truth tables (using laws of logic):

i) ∨ [ ∧ ( ∨ )] ⟺ ii) [(¬ ∨ ¬ ) ⟶ ( ∧ ∧ ) ⟺ ∧

(iii) ( → ) ∧ (¬ ∧ ( ∨ ¬ )) ⟺ ¬[ ∨ ]

(2) Show that [( ∨ ) ∧ ¬(¬ ∧ (¬ ∨ ¬ ))] ∨ (¬ ∧ ¬ ) ∨ (¬ ∧ ¬ ) is tautology using laws of logic.

4. Problems on TRUTH TABLES AND INDEPENDENTS OF ITS COMPONENTS:

Examples:

(1) Find the possible truth values of p, q and r if (i) → ( ∨ ) isFALSE

(ii) ∧ ( → ) is TRUE

(2) Show that ( ∧ ( → )) → is independent of its components.

(3) Let p, q be primitive statements for which the implication → is false. Determine the truth
values for each of the following: (i) ∧ (ii) ¬ ∨ (iii) →

(4) Let p, q, r be propositions having truth values 0, 0 and1 respectively. Find the truth

values of the following compound propositions: i) ( ∧ ) → ii) → ( ∧ )

iii) ∧ ( → ) iv) → ( → ¬ ).

(5) Show that the truth values of the following statements are independent of their

components: i) [ ∧ ( → )] → ii) ( → ) ↔ [¬ ∨ ]

You might also like