JOURNAL ARTICLE

A Family of Decidable Bi-intuitionistic Modal Logics

Abstract

We investigate intuitionistic logics extended both with the co-implication connective of Hilbert-Brouwer logic and with diamond and box modalities. We use a Kripke semantics based on frames with two 'forth' confluence conditions on the modal relation with respect to the intuitionistic relation. We give sound and strongly complete axiomatisations for entailment on this class of frames, and give similar axiomatisations for the subclasses of frames satisfying any combination of reflexivity, transitivity, and seriality. We then prove that all of these logics are decidable, by proving that they have the finite frame property.

Keywords:
Decidability Accessibility relation Kripke semantics Normal modal logic Modal logic Mathematics Relation (database) Preorder S5 Intuitionistic logic Fragment (logic) Discrete mathematics Modal Algebra over a field Pure mathematics Computer science Intermediate logic Description logic Algorithm Theoretical computer science Linear logic

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
27
Refs
0.08
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Logic, Reasoning, and Knowledge
Physical Sciences →  Computer Science →  Artificial Intelligence
Logic, programming, and type systems
Physical Sciences →  Computer Science →  Artificial Intelligence
Advanced Algebra and Logic
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

On a family of decidable modal logics

Алексей Геннадьевич Кравцов

Journal:   Russian Mathematical Surveys Year: 2002 Vol: 57 (4)Pages: 809-810
JOURNAL ARTICLE

Decidable Elementary Modal Logics

Jakub MichaliszynJan Otop

Year: 2012 Vol: 66 Pages: 491-500
BOOK-CHAPTER

Decidable Term-Modal Logics

Eugenio OrlandelliGiovanna Corsi

Lecture notes in computer science Year: 2018 Pages: 147-162
BOOK-CHAPTER

Intuitionistic modal logics

Dov M. Gabbay

Year: 1998 Pages: 76-90
© 2026 ScienceGate Book Chapters — All rights reserved.