A general method for proving decidability of intuitionistic modal logics

DOI10.1016/J.JAL.2005.06.007MaRDI QIDQ2506825zbMATH OpenOpenAlexFDO

Authors Natasha Alechina, Dmitry Shkatov

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)

Recommendations

• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
• scientific article; zbMATH DE number 1303434
• Gentzen sequent calculi for some intuitionistic modal logics
• Tree-sequent calculi and decision procedures for intuitionistic modal logics
• Intuitionistic non-normal modal logics: a general framework

Cites work

• scientific article; zbMATH DE number 4139714 (Why is no real title available?)
• scientific article; zbMATH DE number 3554259 (Why is no real title available?)
• scientific article; zbMATH DE number 1303434 (Why is no real title available?)
• scientific article; zbMATH DE number 1956520 (Why is no real title available?)
• scientific article; zbMATH DE number 1848312 (Why is no real title available?)
• scientific article; zbMATH DE number 1852920 (Why is no real title available?)
• scientific article; zbMATH DE number 1418447 (Why is no real title available?)
• scientific article; zbMATH DE number 1431908 (Why is no real title available?)
• scientific article; zbMATH DE number 3222922 (Why is no real title available?)
• scientific article; zbMATH DE number 3271461 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3052388 (Why is no real title available?)
• A judgmental reconstruction of modal logic
• A modal analysis of staged computation
• A modal extension of intuitionist logic
• Computational types from a logical perspective
• Constructive modal logics. I
• Decidability of Second-Order Theories and Automata on Infinite Trees
• MIPC as the formalisation of an intuitionist concept of modality
• Modal languages and bounded fragments of predicate logic
• Modal logics for communicating systems
• Modality and possibility in some intuitionistic modal logics
• Models for stronger normal intuitionistic modal logics
• Monad as modality
• Notions of computation and monads
• On an intuitionistic modal logic
• Propositional lax logic

Cited in

(11)

• Complexity of finite-variable fragments of propositional temporal and modal logics of computation
• Intuitionistic Decision Procedures Since Gentzen
• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
• Decidability of some classes of modal logic
• Deciding regular grammar logics with converse through first-order logic
• scientific article; zbMATH DE number 4143949 (Why is no real title available?)
• Decidability for some justification logics with negative introspection
• scientific article; zbMATH DE number 4145872 (Why is no real title available?)
• On expressive power of basic modal intuitionistic logic as a fragment of classical FOL
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
• On generalized van Benthem-type characterizations

Describes a project that uses

Uses Software

• MiniML

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

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