From Words to Logic: An Introduction to Propositional Translation

1. The Building Blocks: Propositions and Connectives

Propositional logic (also called sentential logic) is a formal system that deals with propositions and the logical relationships between them.

A proposition is the basic unit of meaning. It is a declarative sentence that can be assigned a truth value of either "true" or "false". For example, "Copper is a metal" is a proposition. "Where are you?" is not, because it is a question.

In propositional logic, we symbolize these simple, or atomic, propositions with capital letters (e.g., $P,Q,R$). These act as variables, analogous to how you might use variables in a program or a physical equation.

Complex, or compound, propositions are formed by combining atomic propositions using logical connectives (also called operators). There are five standard connectives in propositional logic.

A quick note on symbolism: The symbols in the table above ($\wedge ,\vee ,\to ,\leftrightarrow ,\neg$) are common, but you will encounter variations in different texts. For instance:

• Negation ($\neg$) is often written with a tilde ($\sim$).
• Conjunction ($\wedge$) can be a dot ($\cdot$) or an ampersand (&).
• The conditional ($\to$) is often a horseshoe ($\supset$).
• The biconditional ($\leftrightarrow$) can be a triple bar ($\equiv$).

The underlying logic is identical, so it's a matter of getting used to different notations, much like the variations between notations in vector calculus or quantum mechanics (e.g., Dirac notation). We will stick to the set $\{\neg ,\wedge ,\vee ,\to ,\leftrightarrow \}$.

2. A Tour of the Connectives

The main task in translation is to correctly identify the logical connective being used in an English sentence. Let's examine each one, paying special attention to the subtleties of natural language.

Negation ($\neg$)

This is the most straightforward connective. It corresponds to "not" or "it is not the case that".

• "It is raining." $\to$ $R$
• "It is not raining." $\to$ $\neg R$

By convention, we always define the capital letter to stand for the affirmative statement.

Conjunction ($\wedge$)

This operator corresponds to "and". A conjunctive statement $P\wedge Q$ is true if and only if both $P$ and $Q$ are true.

• "The sky is blue and the grass is green." $\to$ $S\wedge G$

English has many words that are truth-functionally equivalent to 'and', even if they carry different connotations. Words like but, although, however, moreover, yet all function as conjunctions.

• "It is raining, but I am happy." $\to$ $R\wedge H$
  The nuance of surprise conveyed by "but" is part of the sentence's rhetoric, not its logical structure.

Be cautious, however. Sometimes 'and' does not function as a logical connective joining two propositions. Consider "Jay and Kay are roommates." This cannot be broken down into "Jay is a roommate and Kay is a roommate" without losing the meaning that they are roommates to each other. This is a relational use of 'and', and in propositional logic, such a statement is treated as a single atomic proposition.

Disjunction ($\vee$)

This corresponds to "or". A disjunctive statement $P\vee Q$ is true if at least one of $P$ or $Q$ is true. This is the inclusive 'or' (P or Q or both).

• "I will have coffee or tea."

Sometimes, English uses an exclusive 'or' (P or Q, but not both), as in "The final will be on Tuesday or Thursday." In logic, you would express this as $(P\vee Q)\wedge \neg (P\wedge Q)$. Unless specified, you should assume 'or' is inclusive.

A common phrase involving disjunction is "neither...nor". The statement "Neither P nor Q" is a negation of a disjunction: $\neg (P\vee Q)$. By De Morgan's laws (which we'll cover in detail later), this is equivalent to $\neg P\wedge \neg Q$. Both are valid translations.

Conditional ($\to$)

This is the most complex and often counter-intuitive connective. $P\to Q$ represents "if P, then Q".

• $P$ is the antecedent (the condition).
• $Q$ is the consequent (the result).

The statement $P\to Q$ is false only when the antecedent $P$ is true and the consequent $Q$ is false. In all other cases, it is true. This leads to the "paradoxes of material implication" (e.g., a false antecedent implies anything), which we will explore later. For now, we focus on translation.

Many English phrases map to the conditional. Here are the most crucial ones:

The translation of "P only if Q" as $P\to Q$ is notoriously tricky. Think of it this way: "P only if Q" means that the only way for P to be true is for Q to also be true. If Q is false, P must be false. This relationship, if not-Q then not-P ($\neg Q\to \neg P$), is the contrapositive of, and thus logically equivalent to, $P\to Q$.

Similarly, "unless" is best translated as "if not". The statement "I will play tennis unless it rains" means "If it does not rain, then I will play tennis" ($\neg R\to T$). This is logically equivalent to $R\vee T$.

For a deeper dive into these crucial conditional translations, the following text is invaluable.

Biconditional ($\leftrightarrow$)

This corresponds to "if and only if" (often abbreviated "iff"). The statement $P\leftrightarrow Q$ is true when $P$ and $Q$ have the same truth value (both true or both false).
It is logically equivalent to $(P\to Q)\wedge (Q\to P)$.

• "A polygon is a triangle if and only if it has three sides." $\to$ $T\leftrightarrow S$

This connective also expresses that a condition is both necessary and sufficient.

• "Being divisible by 2 is a necessary and sufficient condition for being an even number." $\to$ $D\leftrightarrow E$

3. Structure, Ambiguity, and Well-Formed Formulas (WFFs)

When translating complex sentences with multiple connectives, structure is paramount. Just as in mathematics or programming, parentheses are used to eliminate ambiguity and define the scope of each operator. A syntactically correct expression in logic is called a well-formed formula (WFF).

For example, the string $P\wedge Q\vee R$ is ambiguous. Does it mean $(P\wedge Q)\vee R$ or $P\wedge (Q\vee R)$? These have different meanings.

The main connective of a formula is the operator whose scope covers the entire expression—it's the last one you would evaluate. In $(P\wedge Q)\to R$, the main connective is the conditional ($\to$).

Given your background in programming, this is directly analogous to operator precedence and using parentheses to force a specific order of operations. In logic, we don't rely on a predefined precedence hierarchy (like PEMDAS); we must use parentheses explicitly.

A Systematic Approach to Translation

For complex sentences, a step-by-step process is highly effective.

1. Identify and abbreviate the atomic propositions, making sure each is a complete, affirmative declarative sentence.
2. Identify all connectives in the sentence.
3. Identify the main connective. Punctuation (commas) and the overall sentence structure are key guides.
4. Write a hybrid formula, using parentheses to represent the main structure.
5. Recursively translate the smaller constituent parts within the parentheses.
6. Combine the parts into a final, purely symbolic WFF.
7. Check your work by translating the formula back into English to see if it preserves the original meaning.

Example: "If Jones will work only if Smith is fired, then we should fire Smith if we want the job finished."

1. Atomic Propositions:

   • J: Jones will work.
   • F: Smith is fired.
   • S: We should fire Smith.
   • W: We want the job finished.

2. Main Connective: The overall structure is "If [complex proposition A], then [complex proposition B]". So the main connective is the first "if...then" ($\to$).

3. Hybrid Formula (Step 1):
   ($J$ only if $F$) $\to$ ($S$ if $W$)

4. Translate the Antecedent: "J only if F" becomes $J\to F$.

5. Translate the Consequent: "S if W" becomes $W\to S$.

6. Final Formula: Substitute the parts back in:

   $$(J\to F)\to (W\to S)$$

Conclusion

You have now learned the fundamental principles for translating statements from the rich, often ambiguous context of natural language into the precise, syntactically defined language of propositional logic. This process of formalization is the first and most critical step in logical analysis.

Key Takeaways:

• Translation involves breaking down sentences into atomic propositions (symbolized by capital letters) and linking them with five standard connectives ($\neg ,\wedge ,\vee ,\to ,\leftrightarrow$).
• Many different English words can map to the same logical connective. Special attention must be paid to conditional phrases like "only if", "unless", and expressions of "necessity" and "sufficiency".
• Parentheses are essential for creating unambiguous, well-formed formulas (WFFs) by defining the scope of each connective and establishing the main connective of a complex proposition.

Preview of the Next Lesson:

Now that we can represent the structure of individual statements, we are ready to analyze the structure of entire arguments. In our next lesson, we will learn how to construct truth tables to determine the validity of propositional arguments. This method provides a mechanical, semantic procedure for checking whether an argument's conclusion is a logical consequence of its premises.