Skip to main content
Conference ProceedingsOPEN ACCESS

Cut elimination in nested sequents for intuitionistic modal logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7794 LNCS 209-224
DOI: 10.1007/978-3-642-37075-5_14
30Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present cut-free deductive systems without labels for the intuitionistic variants of the modal logics obtained by extending IK with a subset of the axioms d, t, b, 4, and 5. For this, we use the formalism of nested sequents, which allows us to give a uniform cut elimination argument for all 15 logic in the intuitionistic S5 cube. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Straßburger, L. (2013). Cut elimination in nested sequents for intuitionistic modal logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7794 LNCS, pp. 209–224). https://doi.org/10.1007/978-3-642-37075-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free