Question

Match the types of well formed formulas with the expressions. Negation Conjunction Disjunction Conditional Biconditional A. T <-> U B. (A & B) v (C & D) C. R -> ~S D. P & Q E. ~ (R v P)

Answer 1

Answers:

• A. T <-> U  is a biconditional
• B. (A & B) v (C & D)  is a disjunction
• C. R -> ~S  is a conditional
• D. P & Q   is a conjunction
• E. ~(R v P)  is a negation

========================================

Explanations:

• A biconditional is anything in the form A <-> B. This is a compact way of saying (A -> B) & (B -> A). We replace A and B with logical statements.
• Disjunctions are of the basic form A v B. The "v" basically means "or".
• Any conditional is of the form "if... then...". For example, "if it rains, then it gets wet outside" is a conditional. In terms of logic symbols, we write A -> B to mean "if A, then B".
• Conjunctions are whenever we combine two logical statements with an "and" or an ampersand symbol. The basic form is A & B
• Negations are the complete opposite of the original. If the original is P, then the negation is ~P, which is read as "not P".