Professional Documents
Culture Documents
Group 10
BSIT – SE 3A
Discrete Mathematics
Expression Tree
- visual representation for the way that a
formula is built from proposition and logical
operators
A proposition is
represented by a
single node.
p vq
p q
((p v q) ^ r)
(p v q)
p q
((¬p) v q) → (r → p)
((¬p) v q) (r → p)
(¬p)
q r p
p
Discrete Mathematics - Expression Trees
for Formulas
The expression tree for a proportion p, for T or
for F of a single node as shown:
p T F
T (¬Φ)
φ Ψ
T(φ ↔ Ψ)
φ Ψ φ Ψ
T(φ V Ψ) T(φ → Ψ)
φ Ψ
T(φ ↔ Ψ)
Discrete Mathematics - Expression Trees
for Formulas
Let χ be a formula with expression tree T, and
let Ψ be a formula with expression tree U.
Then χ is a subformula of Ψ if, for some node
χ of U, T χ = U χ.
p q
Discrete Mathematics - Expression Trees
for Formulas
Solution: (¬(p v q) )
(p v q)
p q
END