discrete mathematics - How to verify if the given expression is a well formed formula in propositional logic? -
while going through online study material found illustration p ⇒ qr, )p ⇔, ∨(q¬), , p ∧ q ∨ r not formed formulae . according definition of well-formed formulae understand except lastly 1 p ∧ q ∨ r. why not formed formula?
logic discrete-mathematics
No comments:
Post a Comment