A double team semantics for generalized quantifiers
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 6680142 (Why is no real title available?)
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 4118333 (Why is no real title available?)
- A double team semantics for generalized quantifiers
- Characterizing quantifier extensions of dependence logic
- Complexity of the two-variable fragment with counting quantifiers
- Complexity of two-variable dependence logic and IF-logic
- Complexity of two-variable logic on finite trees
- Compositional semantics for a language of imperfect information
- Dependence and independence
- Dependence logic with generalized quantifiers: axiomatizations
- Dependence logic. A new approach to independence friendly logic
- Generalized quantifiers in dependence logic
- Hierarchies in independence logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Independence-friendly logic. A game-theoretic approach
- Model-checking games for logics of imperfect information
- Team building in dependence
- Two-variable first-order logic with equivalence closure
- Two-variable logic on 2-dimensional structures
- Two-variable logic with counting and trees
- Two-variable universal logic with transitive closure
- \(\mathrm{FO}^2\) with one transitive relation is decidable
Cited in
(21)- Compactness in team semantics
- Safe dependency atoms and possibility operators in team semantics
- Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
- Good-for-Game QPTL: An Alternating Hodges Semantics
- On the complexity of linear temporal logic with team semantics
- Doubly strongly first order dependencies
- Expressivity and Complexity of Dependence Logic
- Team semantics for the specification and verification of hyperproperties
- Strongly first order, domain independent dependencies: the union-closed case
- scientific article; zbMATH DE number 7453077 (Why is no real title available?)
- On quantified propositional logics and the exponential time hierarchy
- Characterizing downwards closed, strongly first-order, relativizable dependencies
- Alternating (in)dependence-friendly logic
- Counting of Teams in First-Order Team Logics
- scientific article; zbMATH DE number 7447734 (Why is no real title available?)
- On strongly first-order dependencies
- A double team semantics for generalized quantifiers
- On definability of team relations with \(k\)-invariant atoms
- Boolean dependence logic and partially-ordered connectives
- On the complexity of team logic and its two-variable fragment
- Structural completeness in propositional logics of dependence
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)
