Modal logics with hard diamond-free fragments

DOI10.1093/LOGCOM/EXAA001MaRDI QIDQ5108014zbMATH OpenOpenAlexWikidataFDO

Authors Antonis Achilleos

Publication date 29 April 2020

Published in Journal Of Logic And Computation (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitydiamond-free fragmentslower boundsmodal logicmulti-modalsatisfiability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Modal logics with hard diamond-free fragments
• On the complexity of fragments of modal logics
• Decidable fragments of first-order modal logics
• Modal languages and bounded fragments of predicate logic
• scientific article; zbMATH DE number 6917935
• On non-self-referential fragments of modal logics
• scientific article; zbMATH DE number 7439733
• The monodic fragment of propositional term modal logic
• scientific article; zbMATH DE number 2144768
• scientific article; zbMATH DE number 1523046

Cited in

(2)

• Complexity of finite-variable fragments of propositional modal logics of symmetric frames
• Modal logics with hard diamond-free fragments

This page was built for publication: Modal logics with hard diamond-free fragments

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