Propositional Logic and its Applications with Statement Problems

---

Propositional Logic and its Applications with Statement Problems

---

1. Propositional Logic

Propositional logic is the branch of logic that deals with propositions and logical connectives. It focuses on forming compound statements and analyzing their truth values using formal logic.

A propositional variable (like $p, q, r$) represents a statement that can be either true (T) or false (F). Logical operators (such as $\neg, \land, \lor, \to, \leftrightarrow$) are used to build compound propositions.

---

2. Applications of Propositional Logic

a) Mathematical Proofs

Used to verify the validity of mathematical arguments by translating them into logical forms.

b) Digital Circuit Design

Each logic gate in a circuit (AND, OR, NOT, etc.) corresponds to a logical operation.

c) Programming Conditions

Conditional statements in programming (like if, else) rely on evaluating logical expressions.

d) Artificial Intelligence and Algorithms

Decision-making systems and rule-based engines use propositional logic to reason about knowledge.

e) Database Queries and Filtering

Logical expressions are used to extract information from databases based on certain conditions.

---

3. Translating English Statements into Propositional Logic

Each part of a sentence is treated as a proposition and assigned a symbol. Logical connectives represent how these parts are related.

Example 1:

Statement: "If it is raining, then the ground is wet."

Let
$p$: "It is raining"
$q$: "The ground is wet"

Translation: $p \to q$

---

Example 2:

Statement: "You can have dessert if and only if you finish your dinner."

Let
$p$: "You can have dessert"
$q$: "You finish your dinner"

Translation: $p \leftrightarrow q$

---

Example 3:

Statement: "He studies and he passes the test."

Let
$p$: "He studies"
$q$: "He passes the test"

Translation: $p \land q$

---

Example 4:

Statement: "You will pass unless you skip the exam."

Let
$p$: "You pass"
$q$: "You skip the exam"

"Unless" means "if not", so it becomes: "If you do not skip the exam, then you will pass."
Translation: $\neg q \to p$

---

4. Solving Statement Problems

Problem 1:

Statement: "If the alarm is set, then the house is protected."

Let
$p$: "The alarm is set"
$q$: "The house is protected"

Form: $p \to q$

---

Problem 2:

Statement: "The train is late or the traffic is heavy, but not both."

Let
$p$: "The train is late"
$q$: "The traffic is heavy"

This is an exclusive OR: $p \oplus q$

---

Problem 3:

Statement: "Either you wake up early or you miss the bus."

Let
$p$: "You wake up early"
$q$: "You miss the bus"

Translation: $p \lor q$

If the meaning is "If you do not wake up early, then you miss the bus", then:
Translation: $\neg p \to q$

---

Problem 4:

Statement: "You will not graduate if you fail the final exam."

Let
$p$: "You fail the final exam"
$q$: "You graduate"

Translation: $p \to \neg q$

---

5. Evaluating Compound Statements

Using truth tables or logical equivalences, complex statements can be simplified or verified for validity.

Example:

Evaluate $(p \lor \neg q) \to r$

Create a truth table by listing all possible truth values for $p, q, r$, and compute the final result based on the logic.

---

6. Logical Equivalence in Applications

Logical equivalences allow rewriting complex expressions into simpler or more useful forms.
Common equivalences:

• $p \to q \equiv \neg p \lor q$
• $\neg(p \land q) \equiv \neg p \lor \neg q$
• $\neg(p \lor q) \equiv \neg p \land \neg q$

---