Jump to content

Quantifier shift

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by GoingBatty (talk | contribs) at 03:47, 22 January 2021 (General fixes, removed underlinked tag). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A quantifier shift is a logical fallacy in which the quantifiers of a statement are erroneously transposed. The change in the logical nature of the statement may not be obvious when it is stated in a natural language like English.

Definition

The fallacious deduction is that: For every A, there is a B, such that C. Therefore, there is a B, such that for every A, C.

However, an inverse switching:

is logically valid.

Examples

1. Every person has a woman that is their mother. Therefore, there is a woman that is the mother of every person.

∀x∃y(Px → (Wy & M(yx))) therefore ∃y∀x(Px → (Wy & M(yx)))

It is fallacious to conclude that there is one woman who is the mother of all people.

However, if the major premise ("every person has a woman that is their mother") is assumed to be true, then it is valid to conclude that there is some woman who is any given person's mother.

2. Everybody has something to believe in. Therefore, there is something that everybody believes in.

∀x∃y Bxy therefore ∃y∀x Bxy

It is fallacious to conclude that there is some particular concept to which everyone subscribes.

It is valid to conclude that each person believes a given concept. But it is entirely possible that each person believes in a unique concept.

3. Every natural number has a successor , the smallest of all natural numbers that are greater than . Therefore, there is a natural number that is a successor to all natural numbers.

∀n∃m Snm therefore ∃m∀n Snm

It is fallacious to conclude that there is a single natural number that is the successor of every natural number.

References