Library

Deciding some displayable modal logics

In this paper we use display calculus to show the decidability for normal modal logic K and some of its extensions.

Logic, Reasoning, and KnowledgeMulti-Agent Systems and NegotiationLogic, programming, and type systems
Source

Paper

Similar papers

Non-normal logics: semantic analysis and proof theory (extended version)Jinsheng Chen, Giuseppe Greco, Alessandra Palmigiano et al.2020 · arXiv (Cornell University) In Library
Decidability of Quasi-Dense Modal LogicsTim S. Lyon, Piotr Ostropolski-Nalewaja2024 In Library
Decidability of Quasi-Dense Modal LogicsPiotr Ostropolski-Nalewaja, Tim S. Lyon2024 · arXiv (Cornell University) In Library
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke framesMikhail Rybakov, Dmitry Shkatov2024 · Journal of Logic and Computation In Library
A Proof-Theoretic Study of Modal LogicHirohiko Kushida2026 · arXiv (Cornell University) In Library
Explicit non-normal modal logicAtefeh Rohani, Thomas Studer2024 · Journal of Logic and Computation In Library
Local Reductions for the Modal CubeCláudia Nalon, Ullrich Hustadt, Fabio Papacchini et al.2022 · Lecture notes in computer science In Library
Intuitionistic modal logics: tips and clipsPhilippe Balbiani, Çiğdem Gencer2025 · Logic Journal of IGPL In Library
Reasoning in Non-normal Modal Description LogicsTiziano Dalmonte, Andrea Mazzullo, Ana Ozaki2022 · arXiv (Cornell University) · 3 citations In Library
A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logicSimone Martini, Andrea Masini, Margherita Zorzi2020 · arXiv (Cornell University) In Library
© 2026 NYSGPT2525 LLC