Explainer
Translating English Into Cold Logic Symbols
Strip the adjectives until only the quantifiers remain.
Objective: By the end of this page, you will be able to take a plain English sentence and rewrite it as a logic statement using only the symbols ∀, ∃, →, ∧, ∨, ¬, and the predicates you define yourself.
The skill that matters most is not memorizing symbols. It is deciding what the sentence is actually claiming. Most mistakes happen before you write anything down.
The skill that matters most is not memorizing symbols. It is deciding what the sentence is actually claiming. Most mistakes happen before you write anything down.
Every logic statement starts by deciding what kind of object each word refers to. Take the sentence "Every student passed the exam." The things here are students and exams. Define two predicates before anything else: S(x) means "x is a student," and P(x) means "x passed the exam."
Now the sentence is about objects x, and we can write it as ∀x (S(x) → P(x)). Read this as: for every x, if x is a student, then x passed. The arrow does the work of "if." An arrow is not an "and." This is the first place people go wrong, as the next check shows.
Now the sentence is about objects x, and we can write it as ∀x (S(x) → P(x)). Read this as: for every x, if x is a student, then x passed. The arrow does the work of "if." An arrow is not an "and." This is the first place people go wrong, as the next check shows.
People write "every student passed" as ∀x (S(x) ∧ P(x)). It feels natural because the sentence contains "and" in spirit: a student, and a passer. But that version claims that everything is a student who passed. A table, a chair, and a cloud would all have to be students who passed. Use → after ∀ with a universal claim about a category, and ∧ after ∃ with a claim that something exists with two properties.
Now take "Some student passed the exam." This time the claim is that at least one object is both a student and a passer. That is an existence claim, so the quantifier is ∃, and the connector is ∧.
∃x (S(x) ∧ P(x)). Read it as: there exists an x such that x is a student and x passed.
Check your work by asking what would make the claim false. If every student failed, the sentence is false. The formula is false in exactly the same situation, so it is the right formula.
∃x (S(x) ∧ P(x)). Read it as: there exists an x such that x is a student and x passed.
Check your work by asking what would make the claim false. If every student failed, the sentence is false. The formula is false in exactly the same situation, so it is the right formula.
Worked Example · Logic
Translating a sentence with a negation
Problem
Translate "No student failed the exam" into logic, using S(x) for "x is a student" and F(x) for "x failed the exam."
Steps
- 1.Identify the quantifier. "No student" says there is no object that is a student and a failer. That is a universal claim about all students.—"No" is a negated existence, which is the same as a universal claim with a negation inside.
- 2.Write the universal form: for every x, if x is a student, then x did not fail. ∀x (S(x) → ¬F(x)).—The negation attaches to the predicate F, not to the whole formula.
- 3.Check against the equivalent form ¬∃x (S(x) ∧ F(x)). Both say there is no student who failed.—Two forms that are equivalent is a good sign you have the right claim.
The takeaway
Negation moves through the quantifier: "no X is Y" becomes ∀x (X(x) → ¬Y(x)), or equivalently ¬∃x (X(x) ∧ Y(x)).
Quiz
1/1
1
Statement
The sentence "Some cats are black" translates to ∀x (C(x) → B(x)).
The sentence "Some cats are black" translates to ∀x (C(x) → B(x)).
You answered:FALSE
Incorrect
Why it's false
"Some" is an existence claim, so it needs ∃, and it pairs with ∧. The correct form is ∃x (C(x) ∧ B(x)). The universal form would say every cat is black.
Take the sentence "Every bridge that is old needs repair." Define B(x) for "x is a bridge," O(x) for "x is old," and R(x) for "x needs repair." Now write the translation yourself before reading on. The claim is a universal over bridges, with a condition about being old. A correct answer is ∀x ((B(x) ∧ O(x)) → R(x)).
Test it on a case. Suppose a bridge is new. The sentence says nothing about it, and the formula says nothing about it, because the antecedent is false. A new bridge is consistent with both.
Test it on a case. Suppose a bridge is new. The sentence says nothing about it, and the formula says nothing about it, because the antecedent is false. A new bridge is consistent with both.
quantifier
Definition
A symbol, ∀ (for all) or ∃ (there exists), that says how many objects in a domain a predicate applies to.
Here is one to do alone. "At least one bridge is not safe." Define B(x) for bridge and S(x) for safe. Write the formula, then check that it is false exactly when every bridge is safe.
The answer is ∃x (B(x) ∧ ¬S(x)). Once you can write this, you can read any sentence of this shape: find the quantifier, find the condition, then attach the negation to the predicate it modifies.
The answer is ∃x (B(x) ∧ ¬S(x)). Once you can write this, you can read any sentence of this shape: find the quantifier, find the condition, then attach the negation to the predicate it modifies.
Choose
