The completeness problem for modal logic

DOI10.1007/978-3-319-72056-2_1zbMath1443.03017arXiv1605.01004OpenAlexW2963942981MaRDI QIDQ1709685

Antonis Achilleos

Publication date: 6 April 2018

Full work available at URL: https://arxiv.org/abs/1605.01004

zbMATH Keywords

computational complexitymodal logiccompletenessbisimulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items (2)

When are prime formulae characteristic? ⋮ The complexity of identifying characteristic formulae

This page was built for publication: The completeness problem for modal logic