Boolean dependence logic and partially-ordered connectives

DOI10.1016/J.JCSS.2017.03.009MaRDI QIDQ2361349zbMATH OpenOpenAlexWikidataFDO

Authors Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema

Publication date 30 June 2017

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://trepo.tuni.fi/handle/10024/117024

zbMATH Keywords

dependence logicexistential second-order logicexpressivitypartially-ordered connectives

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Recommendations

• Boolean dependence logic and partially-ordered connectives
• Expressivity and Complexity of Dependence Logic
• Hierarchies in Dependence Logic
• On dependence logic
• Complexity results for modal dependence logic

Cites work

• A double team semantics for generalized quantifiers
• A fragment of dependence logic capturing polynomial time
• Applications of Strict Π₁¹ predicates to infinitary logic
• Axiomatizing first-order consequences in dependence logic
• Boolean dependence logic and partially-ordered connectives
• Characterizing quantifier extensions of dependence logic
• Coherence and computational complexity of quantifier-free dependence logic formulas
• Complexity of model checking for modal dependence logic
• Complexity of two-variable dependence logic and IF-logic
• Complexity of validity for propositional dependence logics
• Complexity results for modal dependence logic
• Computer Science Logic
• Dependence and independence
• Dependence logic with generalized quantifiers: axiomatizations
• Dependence logic. A new approach to independence friendly logic
• Dependence of variables construed as an atomic formula
• Extended modal dependence logic \(\mathcal{EMDL}\)
• Finite partially-ordered quantification
• Finite Partially‐Ordered Quantifiers
• From IF to BI. A tale of dependence and separation
• Henkin quantifiers and complete problems
• Hierarchies in Dependence Logic
• scientific article; zbMATH DE number 6680142 (Why is no real title available?)
• scientific article; zbMATH DE number 5734939 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 1086489 (Why is no real title available?)
• scientific article; zbMATH DE number 4118333 (Why is no real title available?)
• scientific article; zbMATH DE number 972408 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Independence-friendly logic. A game-theoretic approach
• Logical Approaches to Computational Barriers
• Modal dependence logic
• Model-theoretic and computational properties of modal dependence logic
• Monotone monadic SNP and constraint satisfaction
• PARTIALLY ORDERED CONNECTIVES
• Partially ordered connectives and monadic monotone strict NP
• Team building in dependence
• The expressive power of modal dependence logic

Cited in

(4)

• Positive Boolean dependencies
• On definability of team relations with \(k\)-invariant atoms
• Boolean dependence logic and partially-ordered connectives
• Dependently Sorted Logic

This page was built for publication: Boolean dependence logic and partially-ordered connectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361349)