Scribd
Upload
15 views7 pages

Nature of Propositional Logic

Uploaded by

mahigupta.aiml2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views7 pages

Nature of Propositional Logic

Uploaded by

mahigupta.aiml2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Nature of Propositional Logic

Tautology-

• A compound proposition is called tautology if and only if it is true for all possible
truth values of its propositional variables.
• It contains only T (Truth) in last column of its truth table.

Contradiction-

• A compound proposition is called contradiction if and only if it is false for all


possible truth values of its propositional variables.
• It contains only F (False) in last column of its truth table.

Contingency-

• A compound proposition is called contingency if and only if it is neither a


tautology nor a contradiction.
• It contains both T (True) and F (False) in last column of its truth table.

Valid-

• A compound proposition is called valid if and only if it is a tautology.


• It contains only T (Truth) in last column of its truth table.

Invalid-

• A compound proposition is called invalid if and only if it is not a tautology.


• It contains either only F (False) or both T (Truth) and F (False) in last column of
its truth table.

Falsifiable-
• A compound proposition is called falsifiable if and only if it can be made false for
some value of its propositional variables.
• It contains either only F (False) or both T (Truth) and F (False) in last column of
its truth table.

Unfalsifiable-

• A compound proposition is called unfalsifiable if and only if it can never be made


false for any value of its propositional variables.
• It contains only T (Truth) in last column of its truth table.

Satisfiable-
• A compound proposition is called satisfiable if and only if it can be made true for
some value of its propositional variables.
• It contains either only T (Truth) or both T (True) and F (False) in last column of its
truth table.

Unsatisfiable-

• A compound proposition is called unsatisfiable if and only if it can not be made


true for any value of its propositional variables.
• It contains only F (False) in last column of its truth table.

Important Points-

It is important to take a note of the the following points-


• All contradictions are invalid and falsifiable but not vice-versa.
• All contingencies are invalid and falsifiable but not vice-versa.
• All tautologies are valid and unfalsifiable and vice-versa.
• All tautologies are satisfiable but not vice-versa.
• All contingencies are satisfiable but not vice-versa.
• All contradictions are unsatisfiable and vice-versa.
PRACTICE PROBLEMS BASED ON DETERMINING NATURE OF
PROPOSITIONS-

Problem-01:
Determine the nature of following propositions-
1. p ∧ ∼p
2. (p ∧ (p → q)) → ∼q
3. [ (p → q) ∧ (q → r) ] ∧ ( p ∧ ∼r)
4. ∼(p → q) ∨ (∼p ∨ (p ∧ q))
5. (p ↔ r) → (∼q → (p ∧ r))

Solution-

Let us solve all the parts one by one-

Part-01:
Method-01: Using Truth Table-
p ∼p p ∧ ∼p

F T F

T F F

Clearly, last column of the truth table contains only F.


Therefore, given proposition is-
• Contradiction
• Invalid
• Falsifiable
• Unsatisfiable

Part-02:

Method-01: Using Truth Table-

p q p→q p ∧ (p → q) ∼q (p ∧ (p → q)) →∼q

F F T F T T

F T T F F T

T F F F T T

T T T T F F

Clearly, last column of the truth table contains both T and F.


Therefore, given proposition is-
• Contingency
• Invalid
• Falsifiable
• Satisfiable

Part-03:

Method-01: Using Truth Table-

Let [ (p → q) ∧ (q → r) ] ∧ ( p ∧ ∼r) = R (say)

p q r p→q q→r (p → q) ∧ (q → r) p ∧ ∼r R

F F F T T T F F

F F T T T T F F

F T F T F F F F

F T T T T T F F

T F F F T F T F

T F T F T F F F

T T F T F F T F

T T T T T T F F

Clearly, last column of the truth table contains only F.


Therefore, given proposition is-
• Contradiction
• Invalid
• Falsifiable
• Unsatisfiable

Part-04:
Method-01: Using Truth Table-

Let ∼(p → q) ∨ (∼p ∨ (p ∧ q)) = R (say)

p q ∼p p→q ∼(p → q) p∧q ∼p ∨ (p ∧ q) R

F F T T F F T T

F T T T F F T T

T F F F T F F T

T T F T F T T T

Clearly, last column of the truth table contains only T.


Therefore, given proposition is-
• Tautology
• Valid
• Unfalsifiable
• Satisfiable

Part-05:

Method-01: Using Truth Table-

Let (p ↔ r) → (∼q → (p ∧ r)) = R (say)

p q r ∼q p→r r→p p↔r p∧r ∼q → (p ∧ r) R


F F F T T T T F F F

F F T T T F F F F T

F T F F T T T F T T

F T T F T F F F T T

T F F T F T F F F T

T F T T T T T T T T

T T F F F T F F T T

T T T F T T T T T T

Clearly, last column of the truth table contains both T and F.


Therefore, given proposition is-
• Contingency
• Invalid
• Falsifiable
• Satisfiable

You might also like