scientific article; zbMATH DE number 7056226

MaRDI QIDQ5376653zbMATH OpenFDO

Authors Martin Lück

Publication date 17 May 2019

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

zbMATH Keywords

complexitymodal logicsatisfiabiltyteam semantics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Canonical models and the complexity of modal team logic
• Axiomatizations for propositional and modal team logic
• Axiomatizations of team logics
• Complexity of propositional logics in team semantic
• The power of the filtration technique for modal logics with team semantics
• A Van Benthem Theorem for Modal Team Semantics
• Correspondence, canonicity, and model theory for monotonic modal logics
• Canonicity and completeness results for many-valued modal logics
• Logics with multiteam semantics

Cites work

• The Succinctness of First-order Logic over Modal Logic via a Formula Size Game

Cited in

(7)

• A parameterized view on the complexity of dependence logic
• On the complexity of linear temporal logic with team semantics
• On the complexity of team logic and its two-variable fragment
• Canonical models and the complexity of modal team logic
• The power of the filtration technique for modal logics with team semantics
• A Van Benthem Theorem for Modal Team Semantics
• Parameterized complexity of weighted team definability

This page was built for publication:

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