Unit I: Logics and Proofs - Propositional

Logic

This presentation provides a comprehensive overview of Propositional Logic, a fundamental

concept in Discrete Mathematics. We will explore the building blocks of propositional logic,
including propositions, logical connectives, truth tables, and logical equivalences. A case
study will illustrate the practical application of these concepts. This material aligns with the
23MAT202 Discrete Mathematics syllabus at SNS College of Technology.

Slide 1
Title- Logics and Proofs - Propositional Logic

Propositional Logic Hierarchy

Case Study

Practical application of
propositional logic concepts

Equivalences

Statements with identical truth

values

Truth Tables

Tables showing truth values of

logical expressions

Connectives

Symbols linking propositions to

form complex statements

Propositions

Basic statements that can be true

or false
 Presentation components

Title Subtitle Presenter Date Visual

The title of the The subtitle of the The name of the The date of the A visual element,
presentation. presentation. person presenting. presentation. like a logo.

---

Slide 2: Introduction to Logic

• Title: Why Study Logic?

• Bullet Points:
• Foundation for mathematical reasoning.
• Essential for computer science applications (e.g., program verification, AI).
• Provides a framework for constructing valid arguments.
• Helps in analyzing and solving problems systematically.
• Visual: A flowchart illustrating the problem-solving process using logic.
 The Cycle of Logical Reasoning

Systematic Foundation
Problem for
Solving Reasoning
Logic aids in Logic provides the
analyzing and basis for
solving problems mathematical and
methodically. scientific thought.

Constructing Computer
Valid Science
Arguments Applications
Logic helps in Logic is used in
building sound and program
persuasive verification and A I
arguments. development.

---

Slide 3: What is Propositional Logic?

• Title: Propositional Logic: The Basics

• Bullet Points:
• Deals with propositions (statements that are either true or false).
• Uses logical connectives to combine propositions.
• Provides a formal system for reasoning about truth values.
• Visual: A simple diagram showing propositions connected by logical connectives.
 Propositional Logic Pyramid

Statements with true or false values

Symbols linking propositions logically

Formal system for truth value analysis

---

Slide 4: Propositions

• Title: Propositions: The Building Blocks

• Definition: A declarative sentence that is either true or false, but not both.
• Examples:
• "The sky is blue." (True)
• "2 + 2 = 5." (False)
• "It is raining." (Can be true or false depending on the situation)
• Non-Examples:
• "What time is it?" (Question)
• "Go home!" (Command)
• "x + 1= 2" (Not a proposition until 'x' is defined)
• Visual: A table with examples and non-examples of propositions.
 Distinguishing Propositions from Non-
Propositions

No Definite
Definite Truth Truth Value
Value
Non-
Declarative Declarative
Sentences Sentences

Examples of Non-Examples of
Propositions Propositions

---

Slide 5: Logical Connectives

• Title: Logical Connectives: Joining Propositions

• List of Connectives:
• Negation (¬) - "not"
• Conjunction (∧) -"and"
• Disjunction (∨) -"or"
• Implication (→) - "if...then"
• Biconditional ( ↔ ) - " i f and only if"
• Visual: A table summarizing the connectives, their symbols, and their common names.

---

Slide 6: Negation (¬)

• Title: Negation: The "Not" Operator

• Definition: Reverses the truth value of a proposition.
• Truth Table:

| p | ¬p |

| :---- | :---- |
 | True | False |

| False | True |

• Example:
• p: "It is raining."
• ¬p: "It is not raining."
• Visual: A simple truth table for negation.

---

Slide 7: Conjunction (∧)

• Title: Conjunction: The "And" Operator

• Definition: True only if both propositions are true.
• Truth Table:

| p | q | p ∧ q|

| :---- | :---- | :---- |

| True | True | True |

| True | False | False |

| False | True | False |

| False | False | False |

• Example:
• p: "It is raining."
• q: "The sun is shining."
• p ∧ q: "It is raining and the sun is shining."
• Visual: A Venn diagram illustrating the intersection of two sets representing the truth
values of p and q.

---

Slide 8: Disjunction (∨)

• Title: Disjunction: The "Or" Operator

• Definition: True if at least one of the propositions is true (inclusive or).
• Truth Table:

| p | q | p ∨ q|

| :---- | :---- | :---- |

 | True | True | True |

| True | False | True |

| False | True | True |

| False | False | False |

• Example:
• p: "It is raining."
• q: "The sun is shining."
• p ∨ q: "It is raining or the sun is shining (or both)."
• Visual: A Venn diagram illustrating the union of two sets representing the truth values
of p and q.

---

Slide 9: Implication (→)

• Title: Implication: The "If...Then" Operator

• Definition: False only if the hypothesis (p) is true and the conclusion (q) is false.
• Truth Table:

| p | q | p → q|

| :---- | :---- | :---- |

| True | True | True |

| True | False | False |

| False | True | True |

| False | False | True |

• Example:
• p: "It is raining."
• q: "The ground is wet."
• p → q: "If it is raining, then the ground is wet."
• Visual: A diagram illustrating the concept of implication (e.g., a cause-and-effect
relationship).

---

Slide 10: Biconditional ( ↔ )

• Title: Biconditional: The "If and Only If" Operator

• Definition: True if both propositions have the same truth value.
• Truth Table:
 | p | q | p ↔ q |

| :---- | :---- | :---- |

| True | True | True |

| True | False | False |

| False | True | False |

| False | False | True |

• Example:
• p: "The triangle has three sides."
• q: "The shape is a triangle."
• p ↔ q: "The triangle has three sides if and only if the shape is a
• Visual: A diagram illustrating the equivalence of two propositions.

---

Slide 11: Compound Propositions

• Title: Building Complex Statements

• Definition: Propositions formed by combining simpler propositions using logical
connectives.
• Examples:
• (p ∧ q) → r
• ¬(p ∨ q)
• p ↔ (q ∧ ¬r)
• Visual: Examples of compound propositions with parentheses to indicate the order of
operations.

---

Slide 12: Truth Tables for Compound Propositions

• Title: Evaluating Compound Propositions

• Method: Construct a truth table to determine the truth value of a compound
proposition for all possible truth values of its constituent propositions.
• Example: Construct a truth table for (p → q) ∨ ¬p

| p | q | p → q | ¬p | (p → q) ∨ ¬p |

| :---- | :---- | :---- | :---- | :----------- |

| True | True | True | False | True |

| True | False | False | False | False |

 | False | True | True | True | True |

| False | False | True | True | True |

• Visual: A step-by-step guide on how to construct a truth table for a compound

proposition.

---

Slide 13: Logical Equivalence

• Title: When are Propositions the Same?

• Definition: Two propositions are logically equivalent if they have the same truth value
in all possible cases (i.e., their truth tables are identical).
• Notation: p ≡ q
• Example: p → q ≡ ¬p ∨ q
• Visual: Truth tables for p → q and ¬p ∨ q, demonstrating their equivalence.

---

Slide 14: Important Logical Equivalences