A double team semantics for generalized quantifiers

DOI10.1007/s10849-015-9217-4zbMath1350.03025arXiv1310.3032OpenAlexW1983126204WikidataQ38402572 ScholiaQ38402572MaRDI QIDQ302243

Antti Kuusisto

Publication date: 5 July 2016

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.3032

zbMATH Keywords

dependence logicteam semanticsgeneralized quantifiersgame-theoretic semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Complexity of computation (including implicit computational complexity) (03D15) Logic with extra quantifiers and operators (03C80)

Related Items (21)

Boolean dependence logic and partially-ordered connectives ⋮ A double team semantics for generalized quantifiers ⋮ Doubly strongly first order dependencies ⋮ Structural completeness in propositional logics of dependence ⋮ On definability of team relations with \(k\)-invariant atoms ⋮ Alternating (in)dependence-friendly logic ⋮ On the complexity of linear temporal logic with team semantics ⋮ Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Team semantics for the specification and verification of hyperproperties ⋮ On the complexity of team logic and its two-variable fragment ⋮ Negation and partial axiomatizations of dependence and independence logic revisited ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES ⋮ Safe dependency atoms and possibility operators in team semantics ⋮ Expressivity and Complexity of Dependence Logic ⋮ On Strongly First-Order Dependencies ⋮ Counting of Teams in First-Order Team Logics ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A double team semantics for generalized quantifiers
• Model-checking games for logics of imperfect information
• Complexity of two-variable dependence logic and IF-logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Dependence and independence
• Generalized quantifiers in dependence logic
• Complexity of the two-variable fragment with counting quantifiers
• Dependence Logic with Generalized Quantifiers: Axiomatizations
• Hierarchies in independence logic
• Two-Variable Logic on 2-Dimensional Structures.
• Compositional semantics for a language of imperfect information
• Two-Variable Universal Logic with Transitive Closure
• Characterizing quantifier extensions of dependence logic
• Two-Variable Logic with Counting and Trees
• Complexity of Two-Variable Logic on Finite Trees
• Two-Variable First-Order Logic with Equivalence Closure

This page was built for publication: A double team semantics for generalized quantifiers