Author:
Shillito Ian,van der Giessen Iris,Goré Rajeev,Iemhoff Rosalie
Abstract
AbstractWe provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating backward proof search for the intuitionistic Strong Löb logic $$\textsf{iSL}$$, an intuitionistic modal logic with a provability interpretation. A novel measure on sequents is used to prove both the termination of the naive backward proof search strategy, and the admissibility of cut in a syntactic and direct way, leading to a straightforward cut-elimination procedure. All proofs have been formalised in the interactive theorem prover Coq.
Publisher
Springer Nature Switzerland
Reference47 articles.
1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);C D’Abrera,2021
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);B Afshari,2021
3. Ardeshir, M., Mojtahedi, M.: The
-provability logic of HA. Ann. Pure Appl. Logic 169(10), 997–1043 (2018). https://doi.org/10.1016/j.apal.2018.05.001
4. Bellin, G., de Paiva, V., Ritter, E.: Extended Curry-Howard correspondence for a basic constructive modal logic. In: Proceedings of Methods for Modalities, vol. 2 (2001). https://profs.sci.univr.it/~bellin/m4m.ps
5. Bílková, M.: Interpolation in modal logics. Ph.D. thesis, Univerzita Karlova, Prague (2006). https://dspace.cuni.cz/handle/20.500.11956/15732
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献