Jump to content

Conditional quantifier

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nortexoid (talk | contribs) at 04:03, 5 February 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In logic, a conditional quantifier is a kind of Lindström quantifier (or generalized quantifier) that, relative to a classical model , satisfies some or all of the following conditions ('X' and 'Y' range over arbitrary formulas in one free variable):

  • [reflexivity]
  • [right conservativity]
  • [left conservativity]
  • [positive confirmation]
  • [postiive and negative confirmation]
  • [contraposition]
  • [transitivity]
  • [weakening]
  • [conjunction]
  • [disjunction]
  • [symmetry].

(The implication arrow denotes material implication in the metalanguage.) The minimal conditional logic M is characterized by the first six properties, and stronger conditional logics include some of the other ones. For example, the quantifier , which can be viewed as set-theoretic inclusion, satisfies all of the above except [symmetry]. Clearly [symmetry] holds for while e.g. [contraposition] fails.

A semantic interpretation of conditional quantifiers involves a relation between sets of subsets of a given structure—i.e. a relation between properties defined on the structure. Some of the details can be found in the article Lindström quantifier.

References

Serge Lapierre. Conditionals and Quantifiers, in Quantifiers, Logic, and Language, Stanford University, pp. 237-253, 1995.