Analyzing Multiply General Propositions in Logic

Language is remarkably imprecise. When we say “everyone loves someone,” do we mean each person loves a particular someone of their own choosing, or that there is one special person loved by all? These two readings mean very different things – and in formal logic, that difference matters enormously. This is where multiply general propositions come into play. These are propositions that contain two or more quantifiers, and understanding how to analyze them is one of the most important – and genuinely tricky – skills in logical reasoning.

What is a multiply general proposition? 🔗

A proposition in logic becomes general when it uses a quantifier – a term that expresses how broadly or narrowly something applies. The two fundamental quantifiers are the universal quantifier (∀, meaning “for all” or “every”) and the existential quantifier (∃, meaning “there exists” or “some”). A multiply general proposition is simply one that uses two or more such quantifiers together, creating a compound structure that captures more complex relationships than either quantifier could express alone.

As explained in Fiveable’s Formal Logic I notes, multiple quantifiers add depth to logical statements, allowing us to express complex relationships between elements in a domain by combining universal and existential quantifiers to build more intricate logical structures. A simple example: “Every student has read some book” uses both “every” (∀) and “some” (∃). That is a multiply general proposition. On its own, neither quantifier captures the full picture – together, they describe a relationship between two sets.

Why the order of quantifiers is everything 🔗

Here is where multiply general propositions get genuinely interesting – and where students most often go wrong. The order in which quantifiers appear completely changes what a proposition means. This is not a minor technicality; it is central to how logical meaning is structured.

Consider the classic illustration from Wikipedia’s entry on quantifiers in logic:

• ∀n ∃s, s = n² – “For every natural number n, there exists a natural number s such that s = n².” This is clearly true: every number has a square.
• ∃s ∀n, s = n² – “There exists a natural number s such that for every natural number n, s = n².” This is clearly false: no single number is the square of every number at once.

The propositions use exactly the same words and symbols – only the order of the quantifiers has changed. Yet one is true and the other is false. As noted in logic literature, swapping an existential quantifier and an adjacent universal quantifier can fundamentally alter the meaning of a formula, whereas swapping two adjacent quantifiers of the same type – both universal or both existential – leaves the meaning intact.

This point is reinforced formally in Mathematics LibreTexts: the expression ∀x ∃y P(x,y) is not the same as ∃y ∀x P(x,y), so order makes a decisive difference whenever the quantifiers are of different types.

Breaking down the four key combinations 🔗

When two variables are in play, there are four basic combinations of universal and existential quantifiers. Each has a distinct logical meaning.

∀x ∀y – universal followed by universal 🔗

This says the predicate holds for every possible pairing of x and y. As the University of Toronto’s logic notes put it, when two consecutive universal quantifiers are used, the order does not matter – the statement means every combination satisfies the predicate. Example: “For every person x and every person y, if x speaks to y then y can respond” claims something about all pairs without exception.

∃x ∃y – existential followed by existential 🔗

This says there is at least one pair (x, y) for which the predicate holds. Again, when two existential quantifiers appear consecutively, their order is interchangeable. “There exists a person x and a person y such that x trusts y” is equivalent whether you state it x-first or y-first.

∀x ∃y – universal followed by existential 🔗

This is a mixed quantifier structure, and it is the one that requires the most care. It claims: for every x, we can find some y that satisfies the predicate – but that y may be different for each x. “Every person has someone they trust” (∀x ∃y, Trusts(x,y)) allows each person to trust a different individual. This is sometimes called a weaker reading because the existence of y depends on the choice of x.

∃y ∀x – existential followed by universal 🔗

Flip the quantifiers and you get a much stronger claim: there exists some single y such that the predicate holds for every x. “There is someone whom every person trusts” (∃y ∀x, Trusts(x,y)) asserts the existence of one universally trusted individual. Toronto’s course notes demonstrate that an ∃∀ statement logically implies its ∀∃ counterpart – if one person is trusted by everyone, then certainly everyone trusts someone – but the reverse does not hold. The stronger claim entails the weaker, not vice versa.

Translating multiply general propositions into formal notation 🔗

One of the practical skills in logic is moving between natural language and formal notation. This is harder than it looks, because English is deeply ambiguous. The sentence “Everybody loves somebody” can mean ∀x ∃y Loves(x,y) – each person loves at least one person – or, on a less common reading, ∃y ∀x Loves(x,y) – there is someone loved by everyone. Context usually disambiguates, but formal logic demands precision.

The University of Washington’s logic materials give a striking example of how apparently simple sentences hide quantifier ambiguity. A phrase like “a man calls Becky every hour” can mean a single persistent caller (∃ wide scope) or many different callers across different hours (∀ wide scope). The proposition that results from each reading is logically distinct. Choosing the wrong reading produces a formula that misrepresents the situation.

A useful method for systematic translation is described in University of Western Ontario’s Discrete Structures course: first rewrite the sentence in more explicit form, introduce variables explicitly, and then translate step-by-step into a quantified expression. This reduces the risk of ambiguity creeping in from idiomatic language.

Negating multiply general propositions 🔗

Negation is a fundamental operation in logic, and with multiply general propositions it works by a systematic rule: negate each quantifier from left to right, flipping ∀ to ∃ and ∃ to ∀, and then negate the predicate at the end.

As shown in DePaul University’s logic slides, negating ∀x ∃y P(x,y) produces ∃x ∀y ¬P(x,y). The process moves in stages: first the outer universal becomes an existential, then the inner existential becomes a universal, and finally the predicate is negated. The result says: there is some x for which no y satisfies P – which is precisely the condition under which the original statement fails.

Similarly, negating ∃x ∀y P(x,y) yields ∀x ∃y ¬P(x,y): for every x, there is some y that does not satisfy P. University of Washington’s quantifier notes summarize the general negation rule clearly: negate all quantifiers from left to right in the same order, then negate the statement itself. The key principle is taken directly from the single-quantifier rules – negating ∀ gives ∃¬, and negating ∃ gives ∀¬ – applied repeatedly across the chain of quantifiers.

Prenex normal form: organizing multiple quantifiers 🔗

When working with complex propositions containing several quantifiers embedded within larger logical expressions, logicians use a standard organizational format called prenex normal form (PNF). According to Wikipedia, a formula of predicate calculus is in prenex normal form when all quantifiers and their bound variables are written at the front of the expression – the “prefix” – followed by a quantifier-free part called the “matrix.”

Importantly, Fiveable’s Formal Logic II guide notes that converting a formula to prenex normal form maintains its logical equivalence – the underlying meaning and truth conditions remain intact even as the structure is reorganized. Every formula in classical first-order logic can be converted to an equivalent prenex normal form. This matters practically because prenex normal form simplifies the analysis of complex propositions, making it easier to identify which parts are universally quantified and which are existentially quantified, and enabling techniques like Skolemization used in automated theorem proving.

Converting a formula to prenex normal form involves eliminating implications and biconditionals, moving negations inward using De Morgan’s laws (so that ¬∀x becomes ∃x¬ and ¬∃x becomes ∀x¬), renaming bound variables to keep them distinct, and then pulling all quantifiers to the front without changing their relative order.

Why multiply general propositions matter in logic and beyond 🔗

Multiply general propositions are not abstract exercises. They appear throughout mathematics, philosophy, and the sciences wherever relationships between two or more sets of objects need to be expressed precisely.

In mathematics, one of the most important definitions in analysis – the formal definition of a limit – is a multiply general proposition: for every ε > 0, there exists a δ > 0 such that if |x − a| < δ, then |f(x) − L| < ε. This definition, expressed as ∀ε ∃δ …, has been described as a classic example of a statement with multiple quantifiers and a conditional that is foundational to real analysis. Swapping the quantifiers would produce a completely different – and false – claim.

In philosophy, ethical and metaphysical arguments often rest on claims that are implicitly multiply quantified. “Every action has some justification” (∀x ∃y) is a very different philosophical claim from “there is some justification that applies to every action” (∃y ∀x). The first allows different justifications for different actions; the second asserts a universal moral standard. Analyzing such propositions with precision is not pedantry – it is the difference between understanding an argument and misreading it entirely.

In computer science and database theory, multiply general propositions underpin query logic. Statements like “for every user, there exists a session record” or “there exists a record that satisfies all user constraints” are multiply general, and their correct interpretation determines the correctness of system behavior.

Common challenges in analyzing multiply general propositions 🔗

The primary difficulty is that natural language obscures quantifier scope. Words like “every,” “some,” “all,” and “any” do not always map cleanly to ∀ or ∃, and sentences often leave the order of quantification implicit. The word “any” in English is particularly ambiguous – it can function as either a universal or an existential quantifier depending on context, as Marc Cohen’s logic materials at the University of Washington illustrate in detail.

A second challenge is keeping track of scope – which quantifier governs which part of the formula. As formal logic resources note, understanding how quantifiers interact, including their scope and how they bind variables, is essential to grasping advanced logic and is key to precise logical reasoning.

A third challenge is negation. Students frequently negate only the predicate while leaving the quantifiers unchanged, which produces a result that is not the true logical negation of the original. The correct procedure – flipping each quantifier in sequence before negating the predicate – must be applied methodically.

What do you think? If the sentence “every scientist has disproven some theory” were rewritten with the quantifiers reversed to “some theory has been disproven by every scientist,” would the new claim be stronger or weaker – and what would it take for it to be true? And in ethical reasoning, does it matter whether we claim “every person has some moral duty” versus “there is some moral duty that every person holds”?

References

1. https://fiveable.me/formal-logic-i/unit-10/statements-multiple-quantifiers/study-guide/wjRjTD1qPdO3rgnS
2. https://en.wikipedia.org/wiki/Quantifier_(logic)
3. https://math.libretexts.org/Courses/Monroe_Community_College/MTH_220_Discrete_Math/2:_Logic/2.8:_Multiple_Quantiers
4. https://www.teach.cs.toronto.edu/~csc110y/fall/notes/03-logic/07-multiple-quantifiers.html
5. https://faculty.washington.edu/smcohen/120/Chapter11.pdf
6. https://www.csd.uwo.ca/~abrandt5/teaching/DiscreteStructures/Chapter1/pred-logic.html
7. https://condor.depaul.edu/ntomuro/courses/400/bookslides/EppDm4_03_03.pdf
8. https://sites.math.washington.edu/~aloveles/Math300Summer2011/m300Quantifiers.pdf
9. https://en.wikipedia.org/wiki/Prenex_normal_form
10. https://fiveable.me/formal-logic-ii/key-terms/prenex-normal-form
11. https://runestone.academy/ns/books/published/DiscreteMathText/multiplequant3-3.html