**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Problem of multiple generality

Summary

The problem of multiple generality names a failure in traditional logic to describe certain intuitively valid inferences. For example, it is intuitively clear that if:
Some cat is feared by every mouse
then it follows logically that:
All mice are afraid of at least one cat.
The syntax of traditional logic (TL) permits exactly four sentence types: "All As are Bs", "No As are Bs", "Some As are Bs" and "Some As are not Bs". Each type is a quantified sentence containing exactly one quantifier. Since the sentences above each contain two quantifiers ('some' and 'every' in the first sentence and 'all' and 'at least one' in the second sentence), they cannot be adequately represented in TL. The best TL can do is to incorporate the second quantifier from each sentence into the second term, thus rendering the artificial-sounding terms 'feared-by-every-mouse' and 'afraid-of-at-least-one-cat'. This in effect "buries" these quantifiers, which are essential to the inference's validity, within the hyphenated terms. Hence the sentence "Some cat is feared by every mouse" is allotted the same logical form as the sentence "Some cat is hungry". And so the logical form in TL is:
Some As are Bs
All Cs are Ds
which is clearly invalid.
The first logical calculus capable of dealing with such inferences was Gottlob Frege's Begriffsschrift (1879), the ancestor of modern predicate logic, which dealt with quantifiers by means of variable bindings. Modestly, Frege did not argue that his logic was more expressive than extant logical calculi, but commentators on Frege's logic regard this as one of his key achievements.
Using modern predicate calculus, we quickly discover that the statement is ambiguous.
Some cat is feared by every mouse
could mean (Some cat is feared) by every mouse (paraphrasable as Every mouse fears some cat), i.e.
For every mouse m, there exists a cat c, such that c is feared by m,
in which case the conclusion is trivial.
But it could also mean Some cat is (feared by every mouse) (paraphrasable as There's a cat feared by all mice), i.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related MOOCs

Loading

Related publications

Related courses

Related units

Related lectures

Related MOOCs

Related people

No results

No results

Related concepts (2)

No results

No results

No results

No results

Problem of multiple generality

The problem of multiple generality names a failure in traditional logic to describe certain intuitively valid inferences. For example, it is intuitively clear that if: Some cat is feared by every mouse then it follows logically that: All mice are afraid of at least one cat. The syntax of traditional logic (TL) permits exactly four sentence types: "All As are Bs", "No As are Bs", "Some As are Bs" and "Some As are not Bs". Each type is a quantified sentence containing exactly one quantifier.

First-order logic

First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists" is a quantifier, while x is a variable.