PSPACE-completeness of bimodal transitive weak-density logic

DOI10.1093/JIGPAL/JZAF097MaRDI QIDQ6856158zbMATH OpenFDO

Authors Olivier Gasquet

Publication date 19 February 2026

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/JIGPAL/JZAF097

zbMATH Keywords

complexitymodal logics of densitysatisfiability problem

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A general filtration method for modal logics
• A guide to completeness and complexity for modal logics of knowledge and belief
• scientific article; zbMATH DE number 1612551 (Why is no real title available?)
• scientific article; zbMATH DE number 1189095 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 757645 (Why is no real title available?)
• scientific article; zbMATH DE number 1435945 (Why is no real title available?)
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

This page was built for publication: PSPACE-completeness of bimodal transitive weak-density logic

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