Questions: Logical Operators in Arguments: AND, OR, NOT

Question 1

A restaurant menu says: 'Meals come with soup or salad.' In formal propositional logic, which interpretation is correct?

• A. You get exactly one — soup or salad, but not both (exclusive or)
• B. You get at least one — soup, salad, or possibly both (inclusive or)
• C. You must choose soup — salad is the secondary option
• D. The statement is logically undefined without additional context

Answer: (B)

In formal logic, disjunction (OR, ∨) is inclusive by default: P ∨ Q is true whenever at least one of P or Q is true, including when both are true. In everyday speech, 'soup or salad' is usually exclusive — one or the other, not both. This gap between natural language 'or' and logical 'or' is a fundamental source of ambiguity. Formal logic resolves it by standardizing on inclusive or, and uses a separate XOR operator when exclusive or is intended.

Question 2

The statement 'not A and B' is unambiguous in its logical meaning.

• A. True — it unambiguously means A is false while B is true
• B. False — without parentheses, it could mean (¬A) ∧ B or ¬(A ∧ B), which have different truth conditions
• C. True — 'not' always applies to the entire statement that follows it
• D. False — 'and' and 'not' cannot legally appear in the same statement

Answer: (B)

Without parentheses, 'not A and B' is genuinely ambiguous. It could mean (¬A) ∧ B — 'A is false AND B is true' — or ¬(A ∧ B) — 'it is not the case that both A and B are true.' These have different truth tables: the first requires A to be false; the second is false only when both A and B are true. Formal notation uses parentheses to make negation scope explicit, which is exactly why it exists — to resolve ambiguities that natural language cannot.

Question 3

In formal propositional logic, 'P OR Q' is false when both P and Q are true.

• T. True
• F. False

Answer: False

In formal logic, OR (disjunction, ∨) is inclusive: it is true whenever at least one component is true — including when both are true. The only case where P ∨ Q is false is when both P and Q are false. Many students expect logical 'or' to work like everyday 'or' (exclusive — one or the other but not both), but the formal definition is explicitly inclusive. If both components are true, the disjunction is true.

Question 4

A conjunction (AND) statement is true whenever at least one of its components is true.

• T. True
• F. False

Answer: False

This describes disjunction (OR), not conjunction (AND). A conjunction P ∧ Q is true ONLY when both P and Q are true. If either component is false, the entire conjunction is false. Students often mix up the truth conditions of AND and OR: AND requires both components to be true; OR requires at least one. The asymmetry matters — conjunction is far more demanding than disjunction.

Question 5

Why does formal logic define 'or' as inclusive rather than exclusive, and what problem does this solve?

Model answer: Formal logic defines OR as inclusive (true when at least one component is true, including both) because natural language 'or' is ambiguous — sometimes exclusive ('soup or salad, not both') and sometimes inclusive ('you need a passport or a driver's license'). By standardizing on inclusive or, logic provides a single unambiguous truth condition for disjunction. Exclusive or is handled separately with an XOR operator when needed. This removes ambiguity and enables systematic evaluation of compound statements.

The key insight is that formal logical operators trade expressive naturalness for precision. Everyday 'or' means different things in different contexts, making natural language arguments hard to evaluate rigorously. Formal logic freezes each operator's meaning so truth conditions are calculable from the form alone, independent of context. This is the foundation for truth tables and the systematic analysis of argument validity.