{"title":"一些直观模态逻辑的根岑序演算","authors":"Zhe Lin, Minghui Ma","doi":"10.1093/JIGPAL/JZZ020","DOIUrl":null,"url":null,"abstract":"\n Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\\mathscr{L}}_\\Diamond $ and $\\mathscr{L}_{\\Diamond ,\\Box }$ which extend the intuitionistic propositional language with $\\Diamond $ and $\\Diamond ,\\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Gentzen sequent calculi for some intuitionistic modal logics\",\"authors\":\"Zhe Lin, Minghui Ma\",\"doi\":\"10.1093/JIGPAL/JZZ020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\\\\mathscr{L}}_\\\\Diamond $ and $\\\\mathscr{L}_{\\\\Diamond ,\\\\Box }$ which extend the intuitionistic propositional language with $\\\\Diamond $ and $\\\\Diamond ,\\\\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\\\\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable.\",\"PeriodicalId\":304915,\"journal\":{\"name\":\"Log. J. IGPL\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Log. J. IGPL\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/JIGPAL/JZZ020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Log. J. IGPL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/JIGPAL/JZZ020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Gentzen sequent calculi for some intuitionistic modal logics
Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\mathscr{L}}_\Diamond $ and $\mathscr{L}_{\Diamond ,\Box }$ which extend the intuitionistic propositional language with $\Diamond $ and $\Diamond ,\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable.