A double team semantics for generalized quantifiers

DOI10.1007/S10849-015-9217-4zbMATH Open1350.03025DBLPjournals/jolli/Kuusisto15arXiv1310.3032OpenAlexW1983126204WikidataQ38402572 ScholiaQ38402572MaRDI QIDQ302243FDOQ302243

Authors: Antti Kuusisto 

Publication date: 5 July 2016

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

Abstract: We define a semantics for first-order logic with generalized quantifiers based on double teams. We also define and investigate a notion of a generalized atom. Such atoms can be used in order to define extensions of first-order logic with a team-based semantics. We also define a game semantics and compare it with the double team semantics.

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

Recommendations

• Generalized quantifiers in dependence logic
• Dependence logic with generalized quantifiers: axiomatizations
• Dependence logic with generalized quantifiers: axiomatizations
• Counting in team semantics
• Team building in dependence

zbMATH Keywords

team semanticsdependence logicgeneralized quantifiersgame-theoretic semantics

Mathematics Subject Classification ID

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

Cites Work

• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Independence-friendly logic. A game-theoretic approach
• Compositional semantics for a language of imperfect information
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized quantifiers in dependence logic
• Complexity of the two-variable fragment with counting quantifiers
• Dependence logic with generalized quantifiers: axiomatizations
• \(\mathrm{FO}^2\) with one transitive relation is decidable
• Team building in dependence
• Hierarchies in independence logic
• Title not available (Why is that?)
• Two-variable logic on 2-dimensional structures
• A double team semantics for generalized quantifiers
• Model-checking games for logics of imperfect information
• Two-variable universal logic with transitive closure
• Complexity of two-variable dependence logic and IF-logic
• 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

Cited In (22)

• Expressivity and Complexity of Dependence Logic
• Title not available (Why is that?)
• Counting of Teams in First-Order Team Logics
• Strongly first order, domain independent dependencies: the union-closed case
• Compactness in team semantics
• Good-for-Game QPTL: An Alternating Hodges Semantics
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• A double team semantics for generalized quantifiers
• Boolean dependence logic and partially-ordered connectives
• Title not available (Why is that?)
• On the complexity of linear temporal logic with team semantics
• Structural completeness in propositional logics of dependence
• On definability of team relations with \(k\)-invariant atoms
• Safe dependency atoms and possibility operators in team semantics
• Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
• Alternating (in)dependence-friendly logic
• On strongly first-order dependencies
• On the complexity of team logic and its two-variable fragment
• Doubly strongly first order dependencies
• Team semantics for the specification and verification of hyperproperties
• On quantified propositional logics and the exponential time hierarchy
• Negation and partial axiomatizations of dependence and independence logic revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q302243)