Safe dependency atoms and possibility operators in team semantics

DOI10.1016/j.ic.2020.104593OpenAlexW3035019356MaRDI QIDQ2029599

Pietro Galliani

Publication date: 3 June 2021

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

first-order logicsecond-order logicdependence logicteam semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

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
• A double team semantics for generalized quantifiers
• Transition semantics: the dynamics of dependence logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• From IF to BI. A tale of dependence and separation
• Upwards closed dependencies in team semantics
• Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
• Dependence and independence
• Epistemic operators in dependence logic
• Generalized quantifiers in dependence logic
• Independence in Database Relations
• Hierarchies in Inclusion Logic with Lax Semantics
• Hierarchies in Dependence Logic
• Hierarchies in independence logic
• Compositional semantics for a language of imperfect information
• On the complexity of team logic and its two-variable fragment
• CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES
• Expressivity and Complexity of Dependence Logic
• On Strongly First-Order Dependencies
• SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
• Team Logic and Second-Order Logic

This page was built for publication: Safe dependency atoms and possibility operators in team semantics