Cited By
View all- Dalmonte TGrellois COlivetti N(2022)Towards an Intuitionistic Deontic Logic Tolerating Conflicting ObligationsLogic, Language, Information, and Computation10.1007/978-3-031-15298-6_18(280-294)Online publication date: 20-Sep-2022
Terminating Calculi and Countermodels for Constructive Modal Logics
Pages 391 - 408
Abstract
We investigate terminating sequent calculi for constructive modal logics and in the style of Dyckhoff’s calculi for intuitionistic logic. We first present strictly terminating calculi for these logics. Our calculi provide immediately a decision procedure for the respective logics and have good proof-theoretical properties, namely they allow for a syntactic proof of cut admissibility. We then present refutation calculi for non-provability in both logics. Their main feature is that they support direct countermodel extraction: each refutation directly defines a finite countermodel of the refuted formula in a natural neighbourhood semantics for these logics.
References
[1]
Arisaka R, Das A, and Straßburger L On nested sequents for constructive modal logics Log. Methods Comput. Sci. 2015 11 3 1-33
[2]
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)
[3]
Dalmonte T, Grellois C, and Olivetti N Intuitionistic non-normal modal logics: a general framework J. Philos. Log. 2020 49 5 833-882
[4]
Dyckhoff R Contraction-free sequent calculi for intuitionistic logic J. Symb. Log. 1992 57 3 795-807
[5]
Dyckhoff R and Negri S Admissibility of structural rules for contraction-free systems of intuitionistic logic J. Symb. Log. 2000 65 4 1499-1518
[6]
Ferrari M, Fiorentini C, and Fiorino G Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models J. Autom. Reason. 2013 51 2 129-149
[7]
Fischer Servi, G.: Semantics for a class of intuitionistic modal calculi. In: Dalla Chiara, M.L. (ed.) Italian Studies in the Philosophy of Science. BSPS, vol. 47, pp. 59–72. Springer, Dordrecht (1980).
[8]
Fitch FB Intuitionistic modal logic with quantifiers J. Symb. Log. 1950 14 4 113-118
[9]
van der Giessen, I., Iemhoff, R.: Proof theory for intuitionistic strong Löb logic. arXiv preprint arXiv:2011.10383 (2020)
[10]
Girlando M and Straßburger L Peltier N and Sofronie-Stokkermans V MOIN: a nested sequent theorem prover for intuitionistic modal logics (system description) Automated Reasoning 2020 Cham Springer 398-407
[11]
Goldblatt RI Grothendieck topology as geometric modality Math. Log. Q. 1981 27 31–35 495-529
[12]
Goré, R., Postniece, L., Tiu, A.: Cut-elimination and proof search for biintuitionistic tense logic. In: Shehtman, V., Beklemishev, L., Goranko, V. (eds.) Advances in Modal Logic 8, pp. 156–177. College Publications (2010)
[13]
Iemhoff R Terminating sequent calculi for two intuitionistic modal logics J. Log. Comput. 2018 28 7 1701-1712
[14]
Iemhoff, R.: Uniform interpolation and the existence of sequent calculi. Ann. Pure Appl. Log. 170(11), 102711 (2019)
[15]
Kojima K Relational and neighborhood semantics for intuitionistic modal logic Rep. Math. Log. 2012 47 87-113
[16]
Mendler, M., De Paiva, V.: Constructive CK for contexts. Context Representation and Reasoning (CRR-2005) 13 (2005)
[17]
Mendler M and Scheele S Cut-free Gentzen calculus for multimodal CK Inf. Comput. 2011 209 12 1465-1490
[18]
Pinto, L., Dyckhoff, R.: Loop-free construction of counter-models for intuitionistic propositional logic. In: Symposia Gaussiana, Conference A, pp. 225–232 (1995)
[19]
Plotkin, G., Stirling, C.: A framework for intuitionistic modal logics. In: Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge (TARK), pp. 399–406 (1986)
[20]
Prawitz, D.: Natural Deduction: A Proof-Theoretical Study. Almqvist & Wiksell (1965)
[21]
Simpson, A.K.: The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, School of Informatics, University of Edinburgh (1994)
[22]
Stewart C, de Paiva V, and Alechina N Intuitionistic modal logic: a 15-year retrospective J. Log. Comput. 2018 28 5 873-882
[23]
Wijesekera D Constructive modal logics I Ann. Pure Appl. Log. 1990 50 3 271-301
[24]
Wijesekera D and Nerode A Tableaux for constructive concurrent dynamic logic Ann. Pure Appl. Log. 2005 135 1–3 1-72
Index Terms
- Terminating Calculi and Countermodels for Constructive Modal Logics
Index terms have been assigned to the content through auto-classification.
Recommendations
Hypersequent Calculi for Modal Logics Extending S4
New Frontiers in Artificial IntelligenceAbstractIn this paper, we introduce hypersequent calculi for some modal logics extending S4 modal logic. In particular, we uniformly characterize hypersequent calculi for S4, S4.2, S4.3, S5 in terms of what are called “external modal structural rules” for ...
Maehara-style modal nested calculi
AbstractWe develop multi-conclusion nested sequent calculi for the fifteen logics of the intuitionistic modal cube between IK and IS5. The proof of cut-free completeness for all logics is provided both syntactically via a Maehara-style translation and ...
Labelled Sequent Calculi for Inquisitive Modal Logics
Logic, Language, Information, and ComputationAbstractWe present cut-free labelled sequent calculi for various systems of inquisitive modal logic, including inquisitive epistemic logic and inquisitive doxastic logic. Inquisitive modal logic extends the framework of standard modal logic with a ...
Comments
Information & Contributors
Information
Published In
© Springer Nature Switzerland AG 2021.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 06 September 2021
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
Cited By
View all- Dalmonte TGrellois COlivetti N(2022)Towards an Intuitionistic Deontic Logic Tolerating Conflicting ObligationsLogic, Language, Information, and Computation10.1007/978-3-031-15298-6_18(280-294)Online publication date: 20-Sep-2022
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in