Recursive definitions of well-formed formulas (wff)
3.3
propositional variables (p,q,…) are wff
F and T are wff
if A is a wff, then so is ?(A)
if A and B are wff, then so are (A)?(B), (A)?(B), (A)?(B),
(A)?(B), (A)?(B)
Previous slide
Back to first slide
View graphic version