Author:
Heilala Samuli,Pientka Brigitte
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Bierman, G.M., de Paiva, V.C.V.: On an intuitionistic modal logic. Studia Logica 65(3), 383–416 (2000)
2. Lecture Notes in Computer Science;K. Chaudhuri,2005
3. Davies, R., Pfenning, F.: A modal analysis of staged computation. Journal of the ACM 48(3), 555–604 (2001)
4. Degtyarev, A., Voronkov, A.: The inverse method. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 179–272. Elsevier and MIT Press (2001)
5. Dyckhoff, R., Pinto, L.: A permutation-free sequent calculus for intuitionistic logic. Research Report CS/96/9, University of St. Andrews (1996)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Intuitionistic S4 is decidable;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Canonicity of Proofs in Constructive Modal Logic;Lecture Notes in Computer Science;2023
3. A dual-context sequent calculus for the constructive modal logic S4;Mathematical Structures in Computer Science;2022-10
4. Harpoon: Mechanizing Metatheory Interactively;Automated Deduction – CADE 28;2021
5. Game Semantics for Constructive Modal Logic;Lecture Notes in Computer Science;2021