- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Mathematical Logical Terms and Definitions

## Tautologies

A Tautology is a formula which is always true for every value of its propositional variables.

**Example** − Prove [ (A → B) ∧ A ] → B is a tautology

The truth table is as follows −

A | B | A → B | (A → B) ∧ A | [ (A → B) ∧ A ] → B |
---|---|---|---|---|

True | True | True | True | True |

True | False | False | False | True |

False | True | True | False | True |

False | False | True | False | True |

As we can see every value of [ (A → B) ∧ A ] → B is "True", it is a tautology.

## Contradictions

A Contradiction is a formula which is always false for every value of its propositional variables.

**Example** − Prove (A ∨ B) ∧ [ ( ¬ A) ∧ (¬ B) ] is a contradiction

The truth table is as follows −

A | B | A ∨ B | ¬ A | ¬ B | (¬ A) ∧ ( ¬ B) | (A ∨ B) ∧ [( ¬ A) ∧ (¬ B)] |
---|---|---|---|---|---|---|

True | True | True | False | False | False | False |

True | False | True | False | True | False | False |

False | True | True | True | False | False | False |

False | False | False | True | True | True | False |

As we can see every value of A ∨ B) ∧ [ ( ¬ A) ∧ (¬ B) ] is “False”, it is a contradiction.

## Contingency

A Contingency is a formula which has both some true and some false values for every value of its propositional variables.

**Example** − Prove (A ∨ B) ∧ (¬ A) a contingency

The truth table is as follows −

A | B | A ∨ B | ¬ A | (A ∨ B) ∧ (¬ A) |
---|---|---|---|---|

True | True | True | False | False |

True | False | True | False | False |

False | True | True | True | True |

False | False | False | True | False |

As we can see every value of A ∨ B) ∧ (¬ A) has both “True” and “False”, it is a contingency.

## Propositional Equivalences

Two statements X and Y are logically equivalent if any of the following two conditions hold −

The truth tables of each statement have the same truth values.

The bi-conditional statement X ⇔ Y is a tautology.

**Example** − Prove ¬ (A ∨ B) and [ (¬ A) ∧ (¬ B) ] are equivalent

## Testing by 1^{st} method (Matching truth table)

A | B | A ∨ B | ¬ (A ∨ B) | ¬ A | ¬ B | [(¬ A) ∧ (¬ B)] |
---|---|---|---|---|---|---|

True | True | True | False | False | False | False |

True | False | True | False | False | True | False |

False | True | True | False | True | False | False |

False | False | False | True | True | True | True |

Here, we can see the truth values of ¬ (A ∨ B) and [ (¬ A) ∧ (¬ B) ] are same, hence the statements are equivalent.

## Testing by 2^{nd} method (Bi-conditionality)

A | B | ¬ (A ∨ B ) | [(¬ A) ∧ (¬ B)] | [¬ (A ∨ B)] ⇔ [(¬ A ) ∧ (¬ B)] |
---|---|---|---|---|

True | True | False | False | True |

True | False | False | False | True |

False | True | False | False | True |

False | False | True | True | True |

As [ ¬ (A ∨ B) ] ⇔ [ (¬ A ) ∧ (¬ B) ] is a tautology, the statements are equivalent.

## Inverse, Converse, and Contra-positive

Implication / if-then (→) is also called a conditional statement. It has two parts −

- Hypothesis, p
- Conclusion, q

As mentioned earlier, it is denoted as p → q.

**Example of Conditional Statement** − “If you do your homework, you will not be punished.” Here, "you do your homework" is the hypothesis, p, and "you will not be punished" is the conclusion, q.

**Inverse** − An inverse of the conditional statement is the negation of both the hypothesis and the conclusion. If the statement is “If p, then q”, the inverse will be “If not p, then not q”. Thus the inverse of p → q is ¬ p → ¬ q.

**Example** − The inverse of “If you do your homework, you will not be punished” is “If you do not do your homework, you will be punished.”

**Converse** − The converse of the conditional statement is computed by interchanging the hypothesis and the conclusion. If the statement is “If p, then q”, the converse will be “If q, then p”. The converse of p → q is q → p.

**Example** − The converse of "If you do your homework, you will not be punished" is "If you will not be punished, you do your homework”.

**Contra-positive** − The contra-positive of the conditional is computed by interchanging the hypothesis and the conclusion of the inverse statement. If the statement is “If p, then q”, the contra-positive will be “If not q, then not p”. The contra-positive of p → q is ¬ q → ¬ p.

**Example** − The Contra-positive of " If you do your homework, you will not be punished” is "If you are punished, you did not do your homework”.

## Duality Principle

Duality principle states that for any true statement, the dual statement obtained by interchanging unions into intersections (and vice versa) and interchanging Universal set into Null set (and vice versa) is also true. If dual of any statement is the statement itself, it is said **self-dual** statement.

**Example** − The dual of (A ∩ B ) ∪ C is (A ∪ B) ∩ C

## Normal Forms

We can convert any proposition in two normal forms −

- Conjunctive normal form
- Disjunctive normal form

## Conjunctive Normal Form

A compound statement is in conjunctive normal form if it is obtained by operating AND among variables (negation of variables included) connected with ORs. In terms of set operations, it is a compound statement obtained by Intersection among variables connected with Unions.

**Examples**

(A ∨ B) ∧ (A ∨ C) ∧ (B ∨ C ∨ D)

(P ∪ Q) ∩ (Q ∪ R)

## Disjunctive Normal Form

A compound statement is in conjunctive normal form if it is obtained by operating OR among variables (negation of variables included) connected with ANDs. In terms of set operations, it is a compound statement obtained by Union among variables connected with Intersections.

**Examples**

(A ∧ B) ∨ (A ∧ C) ∨ (B ∧ C ∧ D)

(P ∩ Q) ∪ (Q ∩ R)

- Related Questions & Answers
- Mathematical Logical Connectives
- Computer Storage Definitions and Notations
- JavaScript Function Definitions
- Mathematical Logic Statements and Notations
- Definitions Related to Illumination
- Logical AND and OR in Arduino
- Relational and Logical Operators in C
- Initialization, declaration and assignment terms in Java
- Common Terms Used in Lighting and Illumination
- Python Mathematical Functions
- Mathematical Foundation Introduction
- HTML5 Mathematical operators
- C++ Mathematical Functions
- UPDATE with logical AND operator in MySQL
- What is the difference between Definitions and Declarations in Compiler design?