Generalized Quantifiers in Dependence Logic

Abstract
We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in fact definably equivalent to the independence atom recently introduced by Väänänen and Grädel
Keywords Dependence logic  Independence friendly logic  Generalized quantifiers  Multi valued dependence
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,948
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Jon Barwise (1979). On Branching Quantifiers in English. Journal of Philosophical Logic 8 (1):47 - 80.

View all 15 references

Citations of this work BETA
Similar books and articles
Juha Kontinen & Jouko Väänänen (2009). On Definability in Dependence Logic. Journal of Logic, Language and Information 18 (3):317-332.
Analytics

Monthly downloads

Added to index

2012-03-09

Total downloads

20 ( #84,468 of 1,100,819 )

Recent downloads (6 months)

6 ( #44,113 of 1,100,819 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.