CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES

DOI10.1017/jsl.2019.12zbMath1468.03031arXiv1809.00179OpenAlexW2964236594WikidataQ128302723 ScholiaQ128302723MaRDI QIDQ5195061

Pietro Galliani

Publication date: 17 September 2019

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

second-order logicdependence logicteam semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic with extra quantifiers and operators (03C80) Second- and higher-order model theory (03C85)

Related Items (4)

Doubly strongly first order dependencies ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Unnamed Item ⋮ Safe dependency atoms and possibility operators in team semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dependence logic with a majority quantifier
• A double team semantics for generalized quantifiers
• Axiomatizing first-order consequences in dependence logic
• Axiomatizing first-order consequences in independence logic
• A remark on negation in dependence logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• On definability in dependence logic
• Upwards closed dependencies in team semantics
• Definability of second order generalized quantifiers
• Inclusion dependencies and their interaction with functional dependencies
• Model theory.
• Dependence and independence
• Coherence and computational complexity of quantifier-free dependence logic formulas
• Generalized quantifiers in dependence logic
• Dependence logic with generalized quantifiers: axiomatizations
• Axiomatizations of team logics
• 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
• Decidability of predicate logics with team semantics
• The Doxastic Interpretation of Team Semantics
• Expressivity and Complexity of Dependence Logic
• On Strongly First-Order Dependencies
• Some new results in definability
• Team Logic and Second-Order Logic

This page was built for publication: CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES