Practical guide
Every P Is Q vs Some P Is Q: Translate the Domain Correctly
Use a conditional for every P is Q and a conjunction for some P is Q. Complete domain models expose the common swaps and the empty-P case.
On this page
Restrict a universal claim; assert an existential witness
“Every P is Q” is ∀x(Px→Qx); “some P is Q” is ∃x(Px∧Qx). The conditional lets non-P objects remain outside the universal requirement. The conjunction requires the existential witness actually to be P as well as Q.
Start by stating a nonempty domain. P and Q are one-place predicates interpreted as sets of domain objects. “Some” means at least one, with no promise that fewer than all qualify. These are classical formulas, not claims about how every casual use of English works.
Definitions and rules: [1] [2].
Every P is Q: ∀x(Px→Qx)
Some P is Q: ∃x(Px∧Qx)Write the full domain before translating
The first original model has D={A,B,C,D}, P={A,B} and Q={A,C}. Think of these as four anonymous records, with two independently defined yes/no properties. No real survey or product measurement is involved.
On a narrow screen, scroll inside this table. Keyboard users can focus the region and use the arrow keys.
| Object | P? | Q? | P→Q | P∧Q |
|---|---|---|---|---|
| A | True | True | True | True |
| B | True | False | False | False |
| C | False | True | True | False |
| D | False | False | True | False |
Download all memberships for both original models
The universal claim is false because B is P but not Q. The existential claim is true because A is both. C and D do not count as counterexamples to “every P is Q”: neither is P.
These truth values do not depend on how many non-P objects happen to be present. What matters for the universal restriction is whether any actual P falls outside Q.
Diagnose the conjunction and conditional swaps
If you write ∀x(Px∧Qx), you require every object in the domain to have both properties. That says more than every P is Q: it also requires everything to be P. In a mixed domain containing non-P objects, the conjunction formula fails even when all the P objects are Q.
If you write ∃x(Px→Qx), a non-P object can make the conditional true. In the displayed model, D is neither P nor Q, yet P(D)→Q(D) is true. That makes D an existential witness for the conditional formula, without establishing that any P is Q.
Definitions and rules: [1].
On a narrow screen, scroll inside this table. Keyboard users can focus the region and use the arrow keys.
| Domain | P extension | Q extension | ∃x(Px→Qx) | ∃x(Px∧Qx) |
|---|---|---|---|---|
| {A,B} | {A} | Empty | True: B is not P | False: no Q |
This second diagnostic is also constructed. A is P and not Q; B is neither. The conditional existential succeeds at B, while the intended conjunction existential fails. The arrow does not mean “and also.”
Distinguish no P objects from no domain objects
Now use D={A,B}, P empty, and Q={A}. Every instance of Px→Qx is true because its antecedent is false. Thus ∀x(Px→Qx) is true, while ∃xPx and ∃x(Px∧Qx) are false. The universal is often called vacuously true in this situation.
On a narrow screen, scroll inside this table. Keyboard users can focus the region and use the arrow keys.
| Object | P? | Q? | P→Q | P∧Q |
|---|---|---|---|---|
| A | False | True | True | False |
| B | False | False | True | False |
An empty P extension is allowed here. An empty domain is not: our domain still contains A and B. Do not import a result about an empty predicate into a different logic permitting no objects at all.
If the intended statement asserts existence as well, make that explicit: ∃xPx∧∀x(Px→Qx). The universal portion by itself has no existential import in this classical translation.
Definitions and rules: [1].
Change the formula when the stated domain really changes
If the domain is already all and only the P objects, “every one is Q” can be written ∀xQx. For example, a model restricted to the two P records {A,B} need not mention P in the formula. This is a different interpretation key, so write the restriction prominently.
Do not silently restrict the domain merely to make a formula look simpler. If other predicates or relations require additional objects, a mixed domain may be necessary. Then the explicit conditional keeps the universal claim about the intended P subset.
Also check “only P are Q.” That says every Q is P: ∀x(Qx→Px). “Every P is Q” runs the other way. If both are asserted, use the biconditional universally, ∀x(Px↔Qx). The necessary/sufficient guide explains that arrow-direction issue with everyday examples.
Definitions and rules: [1].
Try three translation checks
Treat predicates as explicitly supplied sets and keep the domain nonempty.
Case 1
D={A,B}, P={A}, Q empty. Does ∃x(Px→Qx) establish some P is Q?
Show answer and explanation for case 1
No.
B makes the conditional true because B is not P. No object is Q, so no object satisfies P∧Q.
Case 2
D={A,B} and P is empty. Does every P is Q establish a P exists?
Show answer and explanation for case 2
No.
Every conditional instance has a false antecedent and is true. The existence claim ∃xPx remains false.
Case 3
In a mixed domain, should only P are Q be ∀x(Px→Qx)?
Show answer and explanation for case 3
No: reverse the arrow.
Only P are Q excludes Q objects outside P, so its translation is ∀x(Qx→Px). It does not state that every P is Q.
Sources and further reading
- forall x: Calgary, chapter 24: Sentences with one quantifierFormal background in S1, S2, S3, S5. The records, explanations and worked examples on this page are original additions, rather than copied textbook exercises.
- forall x: Calgary, chapter 31: Truth in FOLFormal background in S1, S2, S3. The records, explanations and worked examples on this page are original additions, rather than copied textbook exercises.
- forall x: Calgary — credits, editions and CC BY 4.0 licenseBased on work by P. D. Magnus and Tim Button, revised and expanded by Aaron Thomas-Bolduc and Richard Zach, with further contributions credited by the textbook. Referenced HTML revision: Fall 2025, bb86fe9 (2026-10-22). No author endorsement is implied.