4 Translation

The framework of propositional logic will enable us to isolate a family of valid argument forms underwritten by the behavior of certain truth functional connectives of English. To that end, we will have to be able to translate from English into the formal language we have just introduced.

A Translation Method

We will now develop the skill of translation from natural language to propositional logic. To that end, we break down the task into three main steps.

Step 1. Find a paraphrase

Paraphrase

We paraphrase the relevant English sentence in order to make clear how the target sentence may be built from simpler constituents by means of connectives such as ‘not’, ‘and’, ‘or’, and ‘if \(\dots\), then \(\dots\)

This first step will often require us to rewrite the sentence to include these connectives as opposed to some of their stylistic variants. We will use parentheses in order to highlight how the sentence has been constructed from simpler sentences.

Example 4.1 Consider the English sentence:

Although Smith is not a flexible negotiator, she will come to an agreement if we lower our demand.

We substitute ‘and’ for the stylistic variant ‘although’, and we rewrite the second part of the sentence to reveal how it is constructed from simpler sentences with the help of a conditional:

(It is not the case that Smith is a flexible negotiator, and (if we lower our demands, then she will come to an agreement)).

Step 2. Substitute the connectives: Substitute \(\neg\) for ‘not’ Substitute \(\wedge\) for ‘and’ Substitute \(\vee\) for ‘or’ Substitute \(\to\) for ‘if \(\dots\), then \(\dots\).’

Substitute the connectives for their counterparts

We replace the occurrences of the connectives we have identified above with the symbols for their counterparts in propositional logic.

Example 4.2 Consider the outcome of the first step above:

(It is not the case that Smith is a flexible negotiator, and (if we lower our demands, she will come to an agreement))

We replace each occurrence of a connective with an occurrence of its formal counterpart:

(\(\neg\) Smith is a flexible negotiator \(\wedge\) (we lower our demands \(\to\) she will come to an agreement)).

Step 3. Substitute a propositional variable for each simple sentence

Replace each simple sentence with a propositional variable

We choose a propositional variable for each simple sentence and we proceed to substitute an occurrence of the propositional variable for each occurrence of the simple sentence in the target sentence.

Example 4.3 Consider the outcome of the second step above:

(It is not the case that Smith is a flexible negotiator, and (if Jones lowers her demands, she will come to an agreement))

Translation key
\(p\): Smith is a flexible negotiator.
\(q\): We lower our demands.
\(r\): Smith will come to an agreement.

We replace each simple sentence with a propositional variable in accordance with a suitable translation key.

\((\neg p \wedge (q \to r))\).

In practice, we will begin with the identification of the propositional atoms and proceed from there:

It will be helpful to look at a more complex example.

Example 4.4 Our target now is the English sentence below:

If cobalt is present, then either there is no nickel present or there is manganese present and a brown color appears.

We proceed in three steps:

Step 1

If Cobalt is present, then (it is not the case that there is nickel present or (there is manganese present and a brown color appears))

Step 2

(Cobalt is present \(\to\) (\(\neg\) there is nickel \(\vee\) (there is manganese \(\wedge\) a brown color appears)))

Translation key
\(p\): Cobalt is present.
\(q\): There is nickel present.
\(r\): There is manganese present.
\(s\): A brown color appears.

Step 3

\((p \to (\neg q \vee (r \wedge s)))\)

In practice, we will begin with the identification of the propositional atoms and proceed from there:

Issues with Translation

Some of the examples above seem deceptively simple. We often find unexpected difficulties when we translate more idiomatic English sentences into the language of propositional logic. Let us distinguish a few different types of problems.

Non-Truth-Functional Connectives

Some connectives resist paraphrase into a truth-functional connective.

Consider the English sentence:

My coffee had a sweet taste because I put sugar into it.

We may be tempted to paraphrase the sentence as a conjunction:

My coffee had a sweet taste and I put sugar into it.

But the paraphrase does not faithfully capture the truth conditions of the original sentence. More to the point, there is no reason to think the connective ‘because’ is truth-functional. In fact, we obtain a sentence with a different truth value when we replace one of its simpler parts, e.g., ‘I put sugar into my coffee’, with another sentence with the same truth value, e.g., ‘Los Angeles is south of San Francisco’:

My coffee had a sweet taste because Los Angeles is south of San Francisco.

To complicate matters even further, some uses of ‘if \(\dots\), then \(\dots\)’ in the subjunctive are not truth-functional.

Consider the sentence:

If I had put motor oil in my coffee, it would have had a sweet taste.

Even if the sentence is false, notice that we may obtain a true sentence when we replace ‘I had put motor oil in my coffee’ with a sentence with the same truth value, e.g., ‘I had put saccharine in my coffee’.

Structural Ambiguity

A sentence may be structurally ambiguous, since there is more than one interpretation on which the sentence is built differently from different simpler sentences.

Consider the sentence:

Jones is at the office and Smith is on zoom or the deal will not be completed.

There are at least two different readings of this sentence depending on whether we regard it as a conjunction or as a disjunction:

Jones is at the office and (Smith is on zoom or the deal will not be completed)
(Jones is at the office and Smith is on zoom) or the deal will not be completed.

These two sentences come with different truth conditions, e.g., only the second sentence is true if Jones is not at the office but the deal is not completed.

Special Phrases

Some English phrases present special challenges of their own.

The next issue arises from the question of how much force to apply to the original sentence in order to find a paraphrase constructed from more familiar truth-functional connectives with the same truth conditions as the original. We now look at several problem cases.

\(\dots\) only if \(\dots\)

\(\dots\) only if \(\dots\)

I will be on time only if I set my alarm.

Despite the superficial similarity between ‘only if’ and ‘if’, they achieve very different effects. Compare the sentence above with the conditional:

I will be on time if I set up my alarm.

This sentence tells us that setting my alarm is a sufficient condition for my being on time and it may be paraphrased:

If I set up my alarm, then I will be on time.

The target sentence is quite different: it states that I must set up my alarm in order to be on time. Otherwise put, the only if sentences says that setting my alarm is in fact a necessary condition for my being on time, and it should be paraphrased:

Translation key
\(p\): I will be on time.
\(q\): I set up my alarm.

If I will be on time, then I will have set up my alarm.
\(p \to q\)

Practice.

Show translation

\(\dots\) if and only if \(\dots\)

\(\dots\) if and only if \(\dots\)

The car will start if, and only if, there is gas in the tank.

It is not uncommon to combine ‘if’ and ‘only if’ into ‘if and only if’, which we should be able to parse as a conjunction:

Translation key
\(p\): The car will start.
\(q\): There is gas in the tank.

The car will start if there is gas in the tank, and the car will start only if there is gas in the tank.
\((q \to p) \wedge (p \to q)\)

That means that the presence of gas in the tank is both a necessary and sufficient condition for the car to start.

We will sometimes use the symbol \(\leftrightarrow\) in order to abbreviate formulas of that form. In general: \[ (\varphi \leftrightarrow \psi) := (\psi \to \varphi) \wedge (\varphi \to \psi). \] It would be acceptable to use that symbol as an abbreviation as we translate from English into the language of propositional logic:

The car will start if there is gas in the tank, and the car will start only if there is gas in the tank.

\((q \to p) \wedge (p \to q)\).
\((p \leftrightarrow q)\)

Neither \(\dots\) nor \(\dots\)

Practice.

Show translation
Neither \(\dots\) nor \(\dots\)

Neither France nor Argentina won the World Cup title.

The goal now is to find a paraphrase constructed from familiar truth-functional connectives that is true if, and only if, the original sentence is true. There is more than one option at this point:

France did not win the World Cup and Argentina did not win the World Cup.

It is not the case that France or Argentina won the World Cup.

In the first case, we turn the original sentence into a conjunction of two negations:

Translation key
\(p\): France won the World Cup.
\(q\): Argentina won the World Cup.

(It is not the case that France won the World Cup and it is not the case that Argentina won the World Cup).
\((\neg p \wedge \neg q)\)

In the second case, we paraphrase the original sentence into the negation of a disjunction:

It is not the case that (France won the World Cup or Argentina won the World Cup).
\(\neg (p \vee q)\)

Both paraphrases are true in exactly the same circumstances, which coincide with the circumstances in which the target sentence is true. That is why both are adequate paraphrases of the original sentence.

Practice.

Show translation

Unless

Unless

I will be rained on unless I carry an umbrella.

The problem is to find a paraphrase constructed from familiar truth-functional connectives that is true in exactly the same circumstances as the original sentence. We have at least two options:

Translation key
\(p\): I will be rained on.
\(q\): I carry an umbrella.

If I do not carry an umbrella, then I will be rained on.
\(\neg q \to p\)

I will be rained on or I carry an umbrella.
\(p \vee q\)

In the first case, we translate ‘unless’ as ‘if not’, whereas in the second case we translate it as ‘or’. The paraphrases turn out to be equivalent in that they are true in exactly the same circumstances, which is what is wanted.

Practice.

Show translation

Otherwise

Otherwise

I will carry an umbrella; otherwise, I will be rained on.

The task now is to find a paraphrase constructed from familiar truth-functional connectives that is true in exactly the same circumstances as the original sentence. For example:

Translation key
\(p\): I will carry an umbrella.
\(q\): I will be rained on.

I will carry an umbrella, and if I do not carry an umbrella, then I will be rained on.
\(p \wedge (\neg p \to q)\)

Practice.

Show translation

Application

The point of translation is to be able to discern valid argument forms in arguments formulated in English. In particular, we will often be interested in the question of whether a natural language argument exhibits a valid propositional form.

Example 4.5 Consider the natural language argument:

I cannot be certain that the animal in the pen is a zebra unless I can rule out that it is not a cleverly painted mule. I cannot rule out that the animal in the pen is a cleverly painted mule. Therefore, I cannot be certain that the animal in the pen is a zebra.

To assess the argument, we follow three steps.

First, we put the argument into premise-conclusion form:

  1. I cannot be certain that the animal in the pen is a zebra unless I can rule out that it is a cleverly painted mule.

  2. I cannot rule out that the animal in the pen is a cleverly painted mule.

  3. Therefore, I cannot be certain that the animal in the pen is a zebra.

Second, we translate the premises and conclusion of the argument into the language of propositional logic. Translation key
\(p\): I can be certain that the animal in the pen is a zebra.
\(q\): I can rule out that the animal in the pen is a cleverly painted mule.

First premise:

I cannot be certain that the animal in the pen is a zebra unless I can rule out that it is not a cleverly painted mule.

If I cannot rule out that the animal in the pen is a cleverly painted mule, then I cannot be certain that the animal in the pen is a zebra.

(\(\neg\) I can rule out that the animal in the pen is a cleverly painted mule \(\to\) \(\neg\) I can be certain that the animal in the pen is a zebra).

\(\neg q \to \neg p\)

Second Premise:

I cannot rule out that the animal in the pen is a cleverly painted mule.

\(\neg\) I can rule out that the animal in the pen is a cleverly painted mule

\(\neg q\)

Conclusion:

I cannot be certain that the animal in the pen is a zebra.

\(\neg\) I can be certain that the animal in the pen is a zebra.

\(\neg p\)

We arrive at the translation of the argument into propositional logic:

  1. \(\neg q \to \neg p\)
  2. \(\neg q\)
  3. \(\neg p\)

Third, we now use the search-for-counterexample method to determine whether the argument is valid in propositional logic:

We aim for an assignment that makes the conclusion false: \[ \begin{array}{|c|c|c|c|c|} \hline p & q & \neg q \to \neg p & \neg q & \neg p \\ \hline T & & & & \color{red}{F} \\ \hline \end{array} \] In order to make the second premise true, we make \(q\) false: \[ \begin{array}{|c|c|c|c|c|} \hline p & q & \neg q \to \neg p & \neg q & \neg p \\ \hline T & F & & T & \color{red}{F} \\ \hline \end{array} \] Unfortunately, the first premise comes out false under that assigment, which means that we cannot provide an assignment under which the premises come out true and the conclusion false. \[ \begin{array}{|c|c|c|c|c|} \hline p & q & \neg q \to \neg p & \neg q & \neg p \\ \hline T & F & ! & T & \color{red}{F} \\ \hline \end{array} \]

Let us move to an even more complex argument.

Example 4.6 Consider the natural language argument:

You will be admitted into the club just in case you apply for club membership and you are not perceived to be eager to join. Applying for club membership is regarded as a sign of eagerness. That is, if you apply for club membership, you will be perceived to be eager to join. So, you will not be admitted into the club.

In order to assess the argument, we follow the same steps as before.

First, we put the argument into premise-conclusion form:

  1. You will be admitted into the club just in case you apply for club membership and you are not perceived to be eager to join.

  2. If you apply for club membership, you will be perceived to be eager to join.

  3. You will not be admitted into the club.

Second, we translate the premises and conclusion of the argument into the language of propositional logic.

Translation key
\(p\): You will be admitted into the club.
\(q\): You will apply for club membership.
\(r\): You will be perceived to be eager to join.

First premise:

You will be admitted into the club if, and only if, (you apply for club membership and you are not perceived to be eager to join).

((you apply for club membership \(\wedge\) \(\neg\) you are perceived to be eager to join) \(\to\) you will be admitted to the club) \(\wedge\) (you will be admitted into the club \(\to\) (you apply for club membership \(\wedge\) \(\neg\) you are perceived to be eager to join)).

\((p \to (q \wedge \neg r)) \wedge ((q \wedge \neg r) \to p)\)

Second Premise:

If you apply for club membership, you will be perceived to be eager to join.

You apply for club membership \(\to\) you will be perceived to be eager to join.

\(q \to r\)

Conclusion:

You will not be admitted into the club.

\(\neg\) You will be admitted into the club.

\(\neg p\)

We arrive at the translation:

  1. \((p \to (q \wedge \neg r)) \wedge ((q \wedge \neg r) \to p)\)
  2. \(q \to r\)
  3. \(\neg p\)

Third, we use the search-for-counterexample method to determine whether the argument is valid in propositional logic:

We aim for an assignment that makes the conclusion false: \[ \begin{array}{|c|c|c|c|c|c|} \hline p & q & r & (p \to (q \wedge \neg r)) \wedge ((q \wedge \neg r) \to p) & q \to r & \neg p \\ \hline T & & & & & \color{red}{F} \\ \hline \end{array} \] In order to make the first premise true, we must make \(q \wedge \neg r\) true, which requires \(q\) to be true and \(r\) to be false: \[ \begin{array}{|c|c|c|c|c|c|} \hline p & q & r & (p \to (q \wedge \neg r)) \wedge ((q \wedge \neg r) \to p) & q \to r & \neg p \\ \hline T & T & F & T & & \color{red}{F} \\ \hline \end{array} \] Unfortunately, that makes the second premise false, which means that we cannot find an assignment under which the premises come out true and the conclusion false. \[ \begin{array}{|c|c|c|c|c|c|} \hline p & q & r & p \to (q \wedge \neg r)) \wedge ((q \wedge \neg r) \to p) & q \to r & p \\ \hline T & T & F & T & ! & \color{red}{F} \\ \hline \end{array} \]

Exercises

  1. Translate the following sentences into the language of propositional logic.

    1. If interest rates fall, then we will be able to borrow more money and inflation will rise.

      Show translation

    2. Your computer will not start unless you turn it on and the battery is fully charged.

      Show translation

    3. The mayor’s office made the decision, even though it did not sit well with its constituents.

      Show translation

    4. You will carry an umbrella outside just in case it is raining or you are under the impression that it is raining.

      Show translation

    5. The deal will be completed if all parties agree to it and the deal is found to be in compliance with current regulations.

      Show translation

  2. Assess the following arguments for propositional validity.

    1. The car will not start unless you turn the ignition and press the accelerator. You turned the ignition but the car failed to start. So, you did not press the accelerator.

    2. The mind is a simple substance only if it is not made of further parts. If the mind is material, then it is is made of further parts. So, if the mind is a simple substance, then it is not material.

    3. My client is not the burglar. For the doors show no signs of forced entry. If the doors show no signs of forced entry, then if my client is the burglar, he must have climbed to the unlocked window on the second floor. However, my client is arthritic and could not climb to that unlocked window on the second floor.

    4. If the British are coming, then they are coming by land or by sea. Paul Revere will light only one lamp, if they are coming by land. He will light two lamps, if they are coming by sea. Paul Revere will light only one lamp. So, the British are coming.

    5. The insurance company will cover your expenses only if you are current with your monthly payments. But if you are current with your monthly payments, then you can afford to cover the expenses yourself. So, the insurance company will not cover your expenses unless you can afford to cover them yourself.