PROPOSITIONAL LOGIC

- SYNTAX-
Semantics of propositional logic
Truth tables
Interpretation of a propositional formula
Semantic concepts
Semantic concepts (contd.)
Example 1. Build the truth tables of the formulas:
Logical equivalences
Logical equivalences (contd.)
 Logical equivalences (contd.)
--- Definitions of the connectives ---
Sets of propositional formulas
Theorems (semantic results)
Example
Example (contd.)
Example (contd.) – Truth table
 Stylistic variants in English for logical connectives

A and B A or B If A, then B A if and only if B

Both A and B Either A or B If A, B A is equivalent to B
A, but B A unless B A is a sufficient A is necessary and
A, although B condition for B sufficient for B
A as well as B A is sufficient for B A just in case B
A, B In case A, B
A, also B Provided that A,
then B
B provided that A
B is necessary for A
A only if B
B if A
 Normal forms - definitions

A literal is a propositional variable or its

negation.
A clause is a disjunction of a finite
number of literals.
A cube is a conjunction of a finite
number of literals.
A formula is in disjunctive normal form
(DNF), if it is written as a disjunction of
cubes:

A formula is in conjunctive normal form

(CNF), if it is written as a conjunction of
clauses:
Property
Normalization algorithm
Normal forms – theoretical results
Example
Example – models of a formula