Conjectured decidability of several membership and consistency problems
Prove that the membership problems for Lbc, Ldc, Lbdc, Lfbdc, Lutra, and Ldtra and the consistency problems for Lbc, Ldc, Lbdc, Lfbdc, Lutra, and Ldtra are decidable.
References
As for (4), we conjecture that the membership problems in Lbc, Ldc, Lbde, Lfbdc, Lutra and Ldtra and the consistency problems in Lbc, Ldc, Lbde, Lfbde, Lutra and Ldtra are decidable.
— Intuitionistic modal logics: a minimal setting
(2502.19060 - Balbiani et al., 26 Feb 2025) in Section 12 (Conclusion)