利用Isabelle / zf机械化的选择公理的相对一致性

Q1 Mathematics
Lawrence Charles Paulson
{"title":"利用Isabelle / zf机械化的选择公理的相对一致性","authors":"Lawrence Charles Paulson","doi":"10.1112/S1461157000000449","DOIUrl":null,"url":null,"abstract":"The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle⁄ZF, building on a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the formalization unusually long, and not entirely satisfactory: two parts of the proof do not fit together. It seems impossible to solve these problems without formalizing the metatheory. However, the present development follows a standard textbook, Kenneth Kunen's Set theory: an introduction to independence proofs , and could support the formalization of further material from that book. It also serves as an example of what to expect when deep mathematics is formalized.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"6 1","pages":"198-248"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157000000449","citationCount":"20","resultStr":"{\"title\":\"The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf\",\"authors\":\"Lawrence Charles Paulson\",\"doi\":\"10.1112/S1461157000000449\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle⁄ZF, building on a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the formalization unusually long, and not entirely satisfactory: two parts of the proof do not fit together. It seems impossible to solve these problems without formalizing the metatheory. However, the present development follows a standard textbook, Kenneth Kunen's Set theory: an introduction to independence proofs , and could support the formalization of further material from that book. It also serves as an example of what to expect when deep mathematics is formalized.\",\"PeriodicalId\":54381,\"journal\":{\"name\":\"Lms Journal of Computation and Mathematics\",\"volume\":\"6 1\",\"pages\":\"198-248\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1112/S1461157000000449\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lms Journal of Computation and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1112/S1461157000000449\",\"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":"Lms Journal of Computation and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1112/S1461157000000449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 20

摘要

选择公理的相对一致性的证明,在先前机械化的反射定理的基础上,用Isabelle / ZF机械化了。在原始证明中对元理论的严重依赖使得形式化异常长,并且不完全令人满意:证明的两个部分不适合在一起。如果不形式化元理论,似乎不可能解决这些问题。然而,目前的发展遵循了标准教科书,肯尼斯·库宁的集合论:独立性证明的介绍,并且可以支持从那本书中进一步材料的形式化。它也可以作为一个例子,说明当深度数学被形式化时将会发生什么。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle⁄ZF, building on a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the formalization unusually long, and not entirely satisfactory: two parts of the proof do not fit together. It seems impossible to solve these problems without formalizing the metatheory. However, the present development follows a standard textbook, Kenneth Kunen's Set theory: an introduction to independence proofs , and could support the formalization of further material from that book. It also serves as an example of what to expect when deep mathematics is formalized.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Lms Journal of Computation and Mathematics
Lms Journal of Computation and Mathematics MATHEMATICS, APPLIED-MATHEMATICS
CiteScore
2.60
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: LMS Journal of Computation and Mathematics has ceased publication. Its final volume is Volume 20 (2017). LMS Journal of Computation and Mathematics is an electronic-only resource that comprises papers on the computational aspects of mathematics, mathematical aspects of computation, and papers in mathematics which benefit from having been published electronically. The journal is refereed to the same high standard as the established LMS journals, and carries a commitment from the LMS to keep it archived into the indefinite future. Access is free until further notice.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信