scientific article; zbMATH DE number 7453077
From MaRDI portal
Publication:5020523
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1902.07794
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (2)
Doubly strongly first order dependencies ⋮ Strongly first order, domain independent dependencies: the union-closed case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A double team semantics for generalized quantifiers
- Complexity of two-variable dependence logic and IF-logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Upwards closed dependencies in team semantics
- Definability of second order generalized quantifiers
- Probabilistic team semantics
- Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
- Approximation and dependence via multiteam semantics
- Dependence and independence
- Generalized quantifiers in dependence logic
- Facets of distribution identities in probabilistic team semantics
- Dependence logic with generalized quantifiers: axiomatizations
- Axiomatizations of team logics
- Some combinatorics of imperfect information
- Independence in Database Relations
- Sensible Semantics of Imperfect Information
- Relational queries computable in polynomial time
- Compositional semantics for a language of imperfect information
- Decidability of predicate logics with team semantics
- CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES
- On Strongly First-Order Dependencies
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
- A Finite Axiomatization of Conditional Independence and Inclusion Dependencies
This page was built for publication:
