100%(4)4 out of 4 people found this document helpful
This preview shows page 1 - 3 out of 6 pages.
CS245 Assignment 1SolutionsQuestion 2 (9pt)For each of the following strings, determine whether is a well formed formula or not. Prove yourclaims by providing a formation sequence. If the string is not a well formed formula, show the stepin the formation sequence where it fails.1. ((p∨ ¬q)↔p)2. (((¬p)∨q)→(¬(p∧(¬q))))3. (p∧((¬q)))∨(¬(p∨q))1
(rule 2) ifU∈Form(LP), then (¬U)∈Form(LP)(rule 3) ifU, V∈Form(LP), then (U*V)∈Form(LP),where*is one of the connectives∧,∨,→,↔.