Which of the following is not a wff?

Question

Which of the following is not a wff? (Only one right answer)

Group of answer choices

∼(A ⦁ ∼B)

((∼A)∨(∼B))

(L ⦁ (P ∨ ∼Q))

(A ⊃ (A ⊃ B))

Answer 1

((∼A)∨(∼B)) is not a well formed formula. At most, there can only be a pair of parentheses per binary (or dyadic) connective in a well formed formula. Since there is only one binary/dyadic connective in 'v', there should be only be one pair of parentheses, rather than three pairs.