1. Determine se as fórmulas a seguir são wffs ("well-formed formula").


a) A

b) (A → B) ∧ C

c) B ∧ (C ∨ D))

d) B ∧ C ∨ D

e) ¬(A ∨ B) ∨ C → D

f) (¬((A ∨ B) ∧ C ↔ ((D ∨ ¬E) → F))

g) ((¬(A ∨ (¬B) ↔ D) ∨ E)