On nested sequents for constructive modal logics

Ryuta Arisaka; Anupam Das; Lutz Strassburger

doi:10.2168/LMCS-11(3:7)2015

On nested sequents for constructive modal logics

Ryuta Arisaka, Anupam Das, Lutz Strassburger

Computer Science

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

65 Downloads (Pure)

Abstract

We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism of nested sequents and give a syntactic proof of cut elimination.

Original language	English
Article number	7
Number of pages	33
Journal	Logical Methods in Computer Science
Volume	11
Issue number	3
DOIs	https://doi.org/10.2168/LMCS-11(3:7)2015
Publication status	Published - 3 Sept 2015

Keywords

Cut-elimination
Intuitionistic logic
Modal logic
Nested sequents
Computer Science
Logic in Computer Science

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.2168/LMCS-11(3:7)2015Licence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

ArisakaR2015OnFinal published version, 474 KBLicence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

https://doi.org/10.2168/LMCS-11(3:7)2015Licence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

Cite this

@article{0f85b5c3b1c84af18d30bc3663562a90,

title = "On nested sequents for constructive modal logics",

abstract = "We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism of nested sequents and give a syntactic proof of cut elimination.",

keywords = "Cut-elimination, Intuitionistic logic, Modal logic, Nested sequents, Computer Science, Logic in Computer Science",

author = "Ryuta Arisaka and Anupam Das and Lutz Strassburger",

year = "2015",

month = sep,

day = "3",

doi = "10.2168/LMCS-11(3:7)2015",

language = "English",

volume = "11",

journal = "Logical Methods in Computer Science",

issn = "1860-5974",

publisher = "IfCoLog",

number = "3",

}

TY - JOUR

T1 - On nested sequents for constructive modal logics

AU - Arisaka, Ryuta

AU - Das, Anupam

AU - Strassburger, Lutz

PY - 2015/9/3

Y1 - 2015/9/3

N2 - We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism of nested sequents and give a syntactic proof of cut elimination.

AB - We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism of nested sequents and give a syntactic proof of cut elimination.

KW - Cut-elimination

KW - Intuitionistic logic

KW - Modal logic

KW - Nested sequents

KW - Computer Science

KW - Logic in Computer Science

UR - http://www.scopus.com/inward/record.url?scp=84943635019&partnerID=8YFLogxK

U2 - 10.2168/LMCS-11(3:7)2015

DO - 10.2168/LMCS-11(3:7)2015

M3 - Article

AN - SCOPUS:84943635019

SN - 1860-5974

VL - 11

JO - Logical Methods in Computer Science

JF - Logical Methods in Computer Science

IS - 3

M1 - 7

ER -

On nested sequents for constructive modal logics

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this