Modal logics with composition on finite forests: expressivity and complexity

DOI10.1145/3373718.3394787MaRDI QIDQ5145629zbMATH OpenOpenAlexWikidataFDO

Authors Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3373718.3394787

zbMATH Keywords

complexityexpressive powergraded modal logicmodal logic on treesseparation logicstatic ambient logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Recommendations

• scientific article; zbMATH DE number 1678388
• On the complexity of modal separation logics
• The power of modal separation logics
• scientific article; zbMATH DE number 1841824
• Complexity of modal logics with Presburger constraints

Cited in

(10)

• Finite approximability of forest superintuitionistic logics
• NP trees and Carnap's modal logic
• scientific article; zbMATH DE number 1389856 (Why is no real title available?)
• scientific article; zbMATH DE number 7577569 (Why is no real title available?)
• Copy and remove as dynamic operators
• On Composing Finite Forests with Modal Logics
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
• Modal logics and local quantifiers: a zoo in the elementary hierarchy
• INTERLEAVING LOGIC AND COUNTING

This page was built for publication: Modal logics with composition on finite forests: expressivity and complexity

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