Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 References  














Conditional quantifier







Add links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Inlogic, a conditional quantifier is a kind of Lindström quantifier (orgeneralized 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 (YX) [right conservativity]
QA X (YX) QA X Y [left conservativity]
QA X Y QA X (YZ) [positive confirmation]
QA X (YZ) QA (XY) Z
QA X Y QA (XZ) (YZ) [positive and negative confirmation]
 
QA X Y QAX) (¬Y) [contraposition]
QA X Y   ∧   QA Y Z QA X Z [transitivity]
QA X Y QA (XZ) Y [weakening]
QA X Y   ∧   QA X Z QA X (YZ) [conjunction]
QA X Z   ∧   QA Y Z QA (XY) 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[edit]

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


Retrieved from "https://en.wikipedia.org/w/index.php?title=Conditional_quantifier&oldid=1070602594"

Category: 
Quantifier (logic)
 



This page was last edited on 8 February 2022, at 09:32 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki