#jsDisabledContent { display:none; } My Account | Register | Help

# Conditional quantifier

Article Id: WHEBN0009320720
Reproduction Date:

 Title: Conditional quantifier Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Conditional quantifier

In logic, a conditional quantifier is a kind of Lindström quantifier (or generalized quantifier) QA that, relative to a classical model A, satisfies some or all of the following conditions ("X" and "Y" range over arbitrary formulas in one free variable):
 QA X X [reflexivity] QA X Y ⇒ QA X (Y∧X) [right conservativity] QA X (Y∧X) ⇒ QA X Y [left conservativity] QA X Y ⇒ QA X (Y∨Z) [positive confirmation] QA X (Y∧Z) ⇒ QA (X∧Y) Z QA X Y ⇒ QA (X∨Z) (Y∨Z) [positive and negative confirmation] QA X Y ⇒ QA (¬X) (¬Y) [contraposition] QA X Y   ∧   QA Y Z ⇒ QA X Z [transitivity] QA X Y ⇒ QA (X∧Z) Y [weakening] QA X Y   ∧   QA X Z ⇒ QA X (Y∧Z) [conjunction] QA X Z   ∧   QA Y Z ⇒ QA (X∨Y) Z [disjunction] QA X Y ⇒ QA Y X [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 ∀A, which can be viewed as set-theoretic inclusion, satisfies all of the above except [symmetry]. Clearly [symmetry] holds for ∃A 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.

Conditional quantifiers are meant to capture certain properties concerning conditional reasoning at an abstract level. Generally, it is intended to clarify the role of conditionals in a first-order language as they relate to other connectives, such as conjunction or disjunction. While they can cover nested conditionals, the greater complexity of the formula, specifically the greater the number of conditional nesting, the less helpful they are as a methodological tool for understanding conditionals, at least in some sense. Compare this methodological strategy for conditionals with that of first-degree entailment logics.

## References

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

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.

Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.