Hierarchies in independence and inclusion logic with strict semantics

DOI10.1093/logcom/exu057zbMath1345.03051arXiv1401.3232OpenAlexW2964104541MaRDI QIDQ5262488

Juha Kontinen, Miika Hannula

Publication date: 15 July 2015

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

hierarchydependence logicteam semanticsinclusion logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Propositional union closed team logics ⋮ 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 ⋮ Approximation and dependence via multiteam semantics ⋮ Expressivity and Complexity of Dependence Logic ⋮ The Expressive Power of k-ary Exclusion Logic ⋮ Model Checking and Validity in Propositional and Modal Inclusion Logics

This page was built for publication: Hierarchies in independence and inclusion logic with strict semantics