AI · Theory

Propositional Logic

Theory

31/215

Propositional Logic

Propositional logic: atomic sentences that are true or false, joined by ∧ ∨ ¬ → ↔. No “for all students”. P = “it rains”. Q = “ground wet”. P → Q. Truth tables decide entailment. Limited, but easy to implement.

You cannot say “every pit has a breeze” without repeating a sentence per square. That limit is why FOL exists. MCQ: implication is not “and”.

Output — idea / do / check for Propositional Logic. Fill those three in the viva.

Exam tip

One implication example + why FOL is richer.

Example

# Propositional Logic
print("idea :", "Propositional Logic")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for Propositional Logic. Fill those three in the viva.

Short notes

DefTrue/false sentences + connectives.
TrapNo quantifiers.

AI · Theory

Propositional Logic

← All stacks

Theory

31/215

Propositional Logic

You cannot say “every pit has a breeze” without repeating a sentence per square. That limit is why FOL exists. MCQ: implication is not “and”.

Output — idea / do / check for Propositional Logic. Fill those three in the viva.

Exam tip

One implication example + why FOL is richer.

Example

# Propositional Logic
print("idea :", "Propositional Logic")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for Propositional Logic. Fill those three in the viva.

Short notes

DefTrue/false sentences + connectives.
TrapNo quantifiers.

Propositional Logic

Example

Short notes

Questions

Propositional Logic

Example

Short notes

Questions