构式S4的对偶和公理化系统，一个正式验证的等价

Q3 Computer Science

Electronic Notes in Theoretical Computer Science Pub Date : 2020-03-01 DOI:10.1016/j.entcs.2020.02.005

Lourdes del Carmen González Huesca , Favio E. Miranda-Perea , P. Selene Linares-Arévalo

{"title":"构式S4的对偶和公理化系统，一个正式验证的等价","authors":"Lourdes del Carmen González Huesca , Favio E. Miranda-Perea , P. Selene Linares-Arévalo","doi":"10.1016/j.entcs.2020.02.005","DOIUrl":null,"url":null,"abstract":"<div><p>We present a proof of the equivalence between two deductive systems for the constructive modal logic S4. On one side, an axiomatic characterization inspired by Hakli and Negri's Hilbert-style system of derivations from assumptions for modal logic K. On the other side, the judgmental reconstruction given by Pfenning and Davies by means of a so-called dual natural deduction approach that makes a distinction between valid, true and possible formulas. Both systems and the proof of their equivalence are formally verified using the Coq proof assistant.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"348 ","pages":"Pages 61-83"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.005","citationCount":"1","resultStr":"{\"title\":\"Dual and Axiomatic Systems for Constructive S4, a Formally Verified Equivalence\",\"authors\":\"Lourdes del Carmen González Huesca , Favio E. Miranda-Perea , P. Selene Linares-Arévalo\",\"doi\":\"10.1016/j.entcs.2020.02.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We present a proof of the equivalence between two deductive systems for the constructive modal logic S4. On one side, an axiomatic characterization inspired by Hakli and Negri's Hilbert-style system of derivations from assumptions for modal logic K. On the other side, the judgmental reconstruction given by Pfenning and Davies by means of a so-called dual natural deduction approach that makes a distinction between valid, true and possible formulas. Both systems and the proof of their equivalence are formally verified using the Coq proof assistant.</p></div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"348 \",\"pages\":\"Pages 61-83\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.005\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066120300050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066120300050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 1

摘要

给出了构式模态逻辑S4的两个演绎系统的等价证明。一方面，受Hakli和Negri的hilbert式模态逻辑k的假设推导系统启发的公理化表征;另一方面，p芬宁和戴维斯通过所谓的对偶自然演绎方法给出了判断重构，该方法区分了有效、真和可能的公式。使用Coq证明助手对两个系统及其等价性的证明进行了形式化验证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Dual and Axiomatic Systems for Constructive S4, a Formally Verified Equivalence

We present a proof of the equivalence between two deductive systems for the constructive modal logic S4. On one side, an axiomatic characterization inspired by Hakli and Negri's Hilbert-style system of derivations from assumptions for modal logic K. On the other side, the judgmental reconstruction given by Pfenning and Davies by means of a so-called dual natural deduction approach that makes a distinction between valid, true and possible formulas. Both systems and the proof of their equivalence are formally verified using the Coq proof assistant.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.