Question

(c)
Define the term 'wff' in propositional logic. Give one example.​

Answer 1

Answer:

In mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language. A formal language can be identified with the set of formulas in the language.

Explanation:

please mark me

Answer 2

Answer:

Propositional logic uses a symbolic “language” to represent the logical structure, or form, of a compound proposition. Like any language, this symbolic language has rules of syntax—grammatical rules for putting symbols together in the right way. Any expression that obeys the syntactic rules of propositional logic is called a well-formed formula, or WFF.

Example:-

~A   :      by rule 2, since A is a WFF

((~A • B) ⊃ ~~C) :      by rule 3, joining (~A • B) and ~~C

NOTE :-    [A~ :   the ~ belongs on the left side of the negated proposition, hence it is not a wff]

HOPE IT HELPS YOU...