A general method for proving decidability of intuitionistic modal logics

DOI10.1016/j.jal.2005.06.007zbMath1106.03005OpenAlexW2077679640MaRDI QIDQ2506825

Dmitry Shkatov, Natasha Alechina

Publication date: 10 October 2006

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2005.06.007

zbMATH Keywords

decidabilityintuitionistic modal logics

Mathematics Subject Classification ID

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

Related Items

On generalized van Benthem-type characterizations ⋮ Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ On expressive power of basic modal intuitionistic logic as a fragment of classical FOL ⋮ Deciding regular grammar logics with converse through first-order logic

Uses Software

• MiniML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for communicating systems
• Constructive modal logics. I
• Notions of computation and monads
• Models for stronger normal intuitionistic modal logics
• Modality and possibility in some intuitionistic modal logics
• Modal languages and bounded fragments of predicate logic
• Propositional lax logic
• Monad as modality
• On an intuitionistic modal logic
• A modal extension of intuitionist logic
• A judgmental reconstruction of modal logic
• A modal analysis of staged computation
• Computational types from a logical perspective
• MIPC as the formalisation of an intuitionist concept of modality
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: A general method for proving decidability of intuitionistic modal logics