EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces

DOI10.1145/3465384zbMath1505.03053OpenAlexW3198236183WikidataQ130818449 ScholiaQ130818449MaRDI QIDQ5056353

Gisela Krommes, Peter H. Hertling

Publication date: 8 December 2022

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

satisfiability problemcomplexity theorysubset space logicEXPSPACE-completenessbimodal product logics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces