模态算子扩展框架下的直觉命题演算。第二部分

IF 1 Q1 MATHEMATICS Formalized Mathematics Pub Date : 2022-04-01 DOI:10.2478/forma-2022-0001
Takao Inoué
{"title":"模态算子扩展框架下的直觉命题演算。第二部分","authors":"Takao Inoué","doi":"10.2478/forma-2022-0001","DOIUrl":null,"url":null,"abstract":"Summary This paper is a continuation of Inoué [5]. As already mentioned in the paper, a number of intuitionistic provable formulas are given with a Hilbert-style proof. For that, we make use of a family of intuitionistic deduction theorems, which are also presented in this paper by means of Mizar system [2], [1]. Our axiom system of intuitionistic propositional logic IPC is based on the propositional subsystem of H1-IQC in Troelstra and van Dalen [6, p. 68]. We also owe Heyting [4] and van Dalen [7]. Our treatment of a set-theoretic intuitionistic deduction theorem is due to Agata Darmochwał’s Mizar article “Calculus of Quantifiers. Deduction Theorem” [3].","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Intuitionistic Propositional Calculus in the Extended Framework with Modal Operator. Part II\",\"authors\":\"Takao Inoué\",\"doi\":\"10.2478/forma-2022-0001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary This paper is a continuation of Inoué [5]. As already mentioned in the paper, a number of intuitionistic provable formulas are given with a Hilbert-style proof. For that, we make use of a family of intuitionistic deduction theorems, which are also presented in this paper by means of Mizar system [2], [1]. Our axiom system of intuitionistic propositional logic IPC is based on the propositional subsystem of H1-IQC in Troelstra and van Dalen [6, p. 68]. We also owe Heyting [4] and van Dalen [7]. Our treatment of a set-theoretic intuitionistic deduction theorem is due to Agata Darmochwał’s Mizar article “Calculus of Quantifiers. Deduction Theorem” [3].\",\"PeriodicalId\":42667,\"journal\":{\"name\":\"Formalized Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Formalized Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/forma-2022-0001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Formalized Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/forma-2022-0001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

摘要

本文是inou[5]的延续。正如文中已经提到的,我们用hilbert式证明给出了一些直观可证明的公式。为此,我们利用了一系列直觉演绎定理,这些定理在本文中也通过Mizar系统[2],[1]给出。我们的直觉命题逻辑IPC公理系统是基于Troelstra和van Dalen [6, p. 68]的H1-IQC命题子系统。我们还欠何亭[4]和范达伦[7]。我们对集合论直觉演绎定理的处理是由于Agata darmochwaov的Mizar文章“量词演算”。演绎定理”[3]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Intuitionistic Propositional Calculus in the Extended Framework with Modal Operator. Part II
Summary This paper is a continuation of Inoué [5]. As already mentioned in the paper, a number of intuitionistic provable formulas are given with a Hilbert-style proof. For that, we make use of a family of intuitionistic deduction theorems, which are also presented in this paper by means of Mizar system [2], [1]. Our axiom system of intuitionistic propositional logic IPC is based on the propositional subsystem of H1-IQC in Troelstra and van Dalen [6, p. 68]. We also owe Heyting [4] and van Dalen [7]. Our treatment of a set-theoretic intuitionistic deduction theorem is due to Agata Darmochwał’s Mizar article “Calculus of Quantifiers. Deduction Theorem” [3].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Formalized Mathematics
Formalized Mathematics MATHEMATICS-
自引率
0.00%
发文量
0
审稿时长
10 weeks
期刊介绍: Formalized Mathematics is to be issued quarterly and publishes papers which are abstracts of Mizar articles contributed to the Mizar Mathematical Library (MML) - the basis of a knowledge management system for mathematics.
期刊最新文献
On the Formalization of Gram-Schmidt Process for Orthonormalizing a Set of Vectors On Bag of 1. Part I Introduction to Graph Enumerations Isosceles Triangular and Isosceles Trapezoidal Membership Functions Using Centroid Method Elementary Number Theory Problems. Part VII
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1