Translating English into propositional logic
Translation questions test whether you can map ordinary English onto the connectives without being misled by word order. The hard cases are a small, fixed list: "only if" is the arrow pointing the other way from "if", "unless" behaves like "or", "necessary" and "sufficient" swap the antecedent and consequent, and "neither … nor" is a negated disjunction. Learn these six patterns and translation questions become mechanical.
✓ Unlimited questions · marked criterion by criterion · no card needed
Method: how to approach it
The order below is what examiners expect to see, and each step carries its own marks.
- Define the atoms explicitlyWrite a dictionary: let p = "it rains", q = "the match is cancelled". Every exam scheme awards marks for this line alone.
- Find the main connectiveIdentify the sentence’s top-level structure before worrying about the parts — the comma and the word order usually reveal it.
- Apply the standard patterns"A if B" is B → A. "A only if B" is A → B. "A unless B" is ¬B → A, equivalently A ∨ B. "B is necessary for A" is A → B. "B is sufficient for A" is B → A.
- Sanity-check with a false casePick the situation where the English is clearly false and confirm your formula is false there too.
Worked example
Translate: "The alarm sounds only if the door is open, and it does not sound unless the power is on."
- Let a = "the alarm sounds", d = "the door is open", w = "the power is on".
- "a only if d" gives a → d.
- "not a unless w" means: if the power is not on, the alarm does not sound, i.e. ¬w → ¬a, equivalently a → w.
- Join the two clauses with ∧.
Answer. (a → d) ∧ (a → w), which can also be written a → (d ∧ w).
Where marks get dropped
These are the specific errors that cost credit on translating english into propositional logic questions — QED's rubric penalises each of them separately.
- Translating "A only if B" as B → A. It is A → B — "only if" introduces a necessary condition, so it points away from A.
- Reading "unless" as "and not". "A unless B" is A ∨ B, i.e. ¬B → A; it does not claim anything when B holds.
- Losing the scope of a negation. "It is not the case that p and q" is ¬(p ∧ q), which is quite different from ¬p ∧ q.
Practise this until it is automatic
Unlimited fresh questions
QED generates new translating english into propositional logic problems on demand at warm-up, exam and challenge level, so you can drill this one skill until it stops costing you marks.
Marked like an examiner
Every answer is scored against a point-by-point rubric with partial credit, so you see exactly which step of the method broke down — not just a tick or a cross.
Answer in real notation
A one-tap symbol palette, a visual equation editor and a truth-table builder — or photograph your handwritten working and QED converts it to LaTeX.
Saved to your library
Every question you generate is kept and re-takeable as a timed exam, and your Propositional Logic mastery is tracked so you know when this is exam-ready.
Translating English into propositional logic — frequently asked questions
Is "unless" the same as "or"?
In classical logic, yes: "A unless B" is standardly rendered ¬B → A, which is equivalent to A ∨ B. Some textbooks treat it as a biconditional, so follow the convention your course states.
How do I handle "necessary and sufficient"?
That is the biconditional. "B is necessary and sufficient for A" translates to A ↔ B, combining A → B and B → A.
Does the choice of letters matter?
Not mathematically, but the dictionary must be stated and used consistently. Markers deduct for a formula whose atoms are never defined.
The rest of Propositional Logic
Connectives, truth tables, equivalences and normal forms. Each subtopic below has its own method, worked example and mark-losing traps.
- 1Truth tables & connectives
- 2Tautology, contradiction & contingency
- 3Logical equivalence & the standard laws
- 4CNF & DNF normal forms
- 5Logical consequence & valid arguments
- 6Translating English into propositional logic
- 7Natural deduction & the standard proof rules
- 8Semantic tableaux & truth trees
- 9Satisfiability & counter-valuations
- 10Functional completeness & adequate sets
- 11Converse, inverse & contrapositive
- 12Resolution & proof by refutation
- 13Soundness & completeness
Ready to make translating english into propositional logic exam-proof?
Generate your first questions free — no card, no setup, no personal data stored. Practise until the method is second nature.
Start practising free →