Generalized Quantifiers in Dependence Logic

Authors:
Fredrik Engström
Affiliations:
Department of Philosophy, Linguistics and Theory of Science, University of Gothenburg, Göteborg, Sweden 405 30
Venue:
Journal of Logic, Language and Information
Year:
2012

Citing 6
Cited 2

Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies

Journal of the ACM (JACM)
A complete axiomatization for functional and multivalued dependencies in database relations

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Dependence Logic: A New Approach to Independence Friendly Logic (London Mathematical Society Student Texts)

Dependence Logic: A New Approach to Independence Friendly Logic (London Mathematical Society Student Texts)
On Definability in Dependence Logic

Journal of Logic, Language and Information
Dependence and Independence

Studia Logica

Model-checking games for logics of imperfect information

Theoretical Computer Science
The Dynamification of Modal Dependence Logic

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

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.