Hierarchies in Inclusion Logic with Lax Semantics

DOI10.1007/978-3-662-45824-2_7zbMath1304.03071arXiv1401.3235OpenAlexW1896271104WikidataQ129241128 ScholiaQ129241128MaRDI QIDQ2937394

Miika Hannula

Publication date: 9 January 2015

Published in: Logic and Its Applications, ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

independencehierarchydependenceteam semanticsdescriptive complexityinclusion

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Descriptive complexity and finite models (68Q19)

Related Items (12)

Propositional union closed team logics ⋮ Doubly strongly first order dependencies ⋮ On definability of team relations with \(k\)-invariant atoms ⋮ Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic ⋮ Axiomatizing first order consequences in inclusion logic ⋮ Unnamed Item ⋮ The expressive power of \(k\)-ary exclusion logic ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES ⋮ Safe dependency atoms and possibility operators in team semantics ⋮ Expressivity and Complexity of Dependence Logic ⋮ On Strongly First-Order Dependencies ⋮ The Expressive Power of k-ary Exclusion Logic

This page was built for publication: Hierarchies in Inclusion Logic with Lax Semantics