Generalized quantifiers in dependence logic
From MaRDI portal
Publication:2255198
DOI10.1007/S10849-012-9162-4zbMATH Open1305.03024arXiv1103.0396OpenAlexW3102477048MaRDI QIDQ2255198FDOQ2255198
Publication date: 9 February 2015
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Abstract: We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindstr"om, 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 emph{independence atom} recently introduced by V"a"an"anen and Gr"adel.
Full work available at URL: https://arxiv.org/abs/1103.0396
Recommendations
- Dependence logic with generalized quantifiers: axiomatizations
- Dependence logic with generalized quantifiers: axiomatizations
- scientific article; zbMATH DE number 1140581
- scientific article; zbMATH DE number 1453079
- Generalized quantifiers and modal logic
- Characterizing quantifier extensions of dependence logic
- Generalized Quantifiers and Logical Reducibilities
- scientific article; zbMATH DE number 3946094
- Generalized quantification as substructural logic
- A note on logicality of generalized quantifiers
Cites Work
- Dependence logic. A new approach to independence friendly logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Quantifiers vs. Quantification Theory
- Compositional semantics for a language of imperfect information
- Title not available (Why is that?)
- Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
- On definability in dependence logic
- From IF to BI. A tale of dependence and separation
- On a generalization of quantifiers
- Title not available (Why is that?)
- On branching quantifiers in English
- Hierarchies of Partially Ordered Connectives and Quantifiers
- Title not available (Why is that?)
Cited In (29)
- CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES
- Expressivity and Complexity of Dependence Logic
- Title not available (Why is that?)
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
- Title not available (Why is that?)
- Frame Theory, Dependence Logic and Strategies
- Complexity of syntactical tree fragments of independence-friendly logic
- Dynamic Logics of Imperfect Information: From Teams and Games to Transitions
- Characterizing quantifier extensions of dependence logic
- A double team semantics for generalized quantifiers
- Dependence logic with a majority quantifier
- Dependence logic with generalized quantifiers: axiomatizations
- Title not available (Why is that?)
- Dependency Concepts up to Equivalence.
- DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS
- Immediate consequences operator on generalized quantifiers
- Generalized quantification as substructural logic
- Dimension in team semantics
- General models and entailment semantics for independence logic
- On Strongly First-Order Dependencies
- Upwards closed dependencies in team semantics
- Transition semantics: the dynamics of dependence logic
- Safe dependency atoms and possibility operators in team semantics
- Characterizing counterfactuals and dependencies over (generalized) causal teams
- Generalized quantifiers and modal logic
- Generalising Predicate and Argument Invariance
- Games for Inclusion Logic and Fixed-Point Logic
- Embedding causal team languages into predicate logic
- Doubly strongly first order dependencies
This page was built for publication: Generalized quantifiers in dependence logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255198)
