Problem of multiple generality

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. 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 alloted 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," 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", i.e.

:"For every mouse m, there exists a cat c, such that c is feared by m,":forall m. , ext{Mouse}(m) ightarrow exists c. , ext{Cat}(c) land ext{Fears}(m,c)

in which case the conclusion is trivial.

But it could also mean "Some cat is (feared by every mouse)", i.e.

:"There exists a cat c, such that for every mouse m, c is feared by m.":exists c. , ext{Cat}(c) land forall m. , ext{Mouse}(m) ightarrow ext{Fears}(m,c)

This example illustrates the importance of specifying the scope of quantifiers as "for all" and "there exists".

Further reading

Patrick Suppes, "Introduction to Logic", D. Van Nostrand, 1957, ISBN 0-422-08072-7.

A. G. Hamilton, "Logic for Mathematicians", Cambridge University Press, 1978, ISBN 0-521-29291-3.

Paul Halmos and Steven Givant, "Logic as Algebra", MAA, 1998, ISBN 0-88385-327-2.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Multiple realizability — Hilary Putnam, one of the founders of multiple realizability Multiple realizability, in philosophy of mind, is the thesis that the same mental property, state, or event can be implemented by different physical properties, states or events. The… …   Wikipedia

  • Elliptic boundary value problem — In mathematics, an elliptic boundary value problem is a special kind of boundary value problem which can be thought of as the stable state of an evolution problem. For example, the Dirichlet problem for the Laplacian gives the eventual… …   Wikipedia

  • Logic — For other uses, see Logic (disambiguation). Philosophy …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • History of logic — Philosophy ( …   Wikipedia

  • Formal semantics — See also Formal semantics of programming languages. Formal semantics is the study of the semantics, or interpretations, of formal languages. A formal language can be defined apart from any interpretation of it. This is done by designating a set… …   Wikipedia

  • William of Sherwood — (or Shyreswood, Shireswood) (1190 ndash; 1249), was a medieval English logician and teacher. Little is known of his life, but he is thought to have studied in Paris, as a master at Oxford in 1252, treasurer of Lincoln from 1254/8 onwards, and a… …   Wikipedia

  • Monadic predicate calculus — In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P… …   Wikipedia

  • Frege , (Friedrich Ludwig) Gottlob — (1848–1925) German philosopher and mathematician Born at Wismar (now in Germany), Frege studied at the universities of Jena and Göttingen, where he obtained his PhD in 1873. He then returned to Jena as a lecturer, where he remained for the rest… …   Scientists

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”