All finitely axiomatizable subframe logics containing the provability logic CSM\(_0\) are decidable

DOI10.1007/S001530050090zbMath0910.03015OpenAlexW1967370452MaRDI QIDQ1128179

Frank Wolter

Publication date: 25 October 1998

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050090

zbMATH Keywords

completenessdecidabilityprovability logicaxiomatizationbimodal logicKripke-type frames

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

This page was built for publication: All finitely axiomatizable subframe logics containing the provability logic CSM\(_0\) are decidable