((∼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.

Gearmay G.

asked • 04/04/20# Which of the following is not a wff?

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))

Follow
•
2

Add comment

More

Report

## 1 Expert Answer

## Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.

Most questions answered within 4 hours.

#### OR

Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.