On the Decidability of Elementary Modal Logics

DOI10.1145/2817825zbMath1367.03043MaRDI QIDQ5277903

Jan Otop, Emanuel Kieroński, Jakub Michaliszyn

Publication date: 12 July 2017

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

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

zbMATH Keywords

computational complexity; modal logic; elementary logics

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

03B25: Decidability of theories and sets of sentences

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)