On Strongly First-Order Dependencies

DOI10.1007/978-3-319-31803-5_4zbMath1429.03116arXiv1403.3698OpenAlexW1482215821MaRDI QIDQ5213641

Pietro Galliani

Publication date: 4 February 2020

Published in: Dependence Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items (13)

Axiomatizations of team logics ⋮ Doubly strongly first order dependencies ⋮ A parameterized view on the complexity of dependence logic ⋮ Separation logic and logics with team semantics ⋮ On elementary logics for quantitative dependencies ⋮ COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A double team semantics for generalized quantifiers
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• From IF to BI. A tale of dependence and separation
• Dependence and independence
• 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
• Characterizing quantifier extensions of dependence logic
• The Doxastic Interpretation of Team Semantics
• Team Logic and Second-Order Logic

This page was built for publication: On Strongly First-Order Dependencies