For a formula α ∈ WFF we let l(α) denote the number of
symbols in α that are left
brackets ‘(’, let d(α) the number of variable symbols, and m(α) the
number of symbols
that are the corner symbol ‘¬’. For example in ((p1 → p2) ∧ ((¬p1)
→ p2)) we have
l(α) = 4, d(α) = 4 and m(α) = 1. Prove by induction that he
following property holds
for all well formed formulas:
l(α) = d(α) + m(α) − 1
Get Answers For Free
Most questions answered within 1 hours.