发布求助
文献互助 智能选刊 最新文献

International Conference on Interactive Theorem Proving最新文献

筛选
英文 中文
Formalizing Norm Extensions and Applications to Number Theory 规范扩展的形式化及其在数论中的应用
International Conference on Interactive Theorem Proving Pub Date : 2023-06-29 DOI: 10.48550/arXiv.2306.17234
María Inés de Frutos-Fernández
{"title":"Formalizing Norm Extensions and Applications to Number Theory","authors":"María Inés de Frutos-Fernández","doi":"10.48550/arXiv.2306.17234","DOIUrl":"https://doi.org/10.48550/arXiv.2306.17234","url":null,"abstract":"Let $K$ be a field complete with respect to a nonarchimedean real-valued norm, and let $L/K$ be an algebraic extension. We show that there is a unique norm on $L$ extending the given norm on $K$, with an explicit description. As an application, we extend the $p$-adic norm on the field $mathbb{Q}_p$ of $p$-adic numbers to its algebraic closure $mathbb{Q}_p^{text{alg}}$, and we define the field $mathbb{C}_p$ of $p$-adic complex numbers as the completion of the latter with respect to the $p$-adic norm. Building on the definition of $mathbb{C}_p$, we formalize the definition of the Fontaine period ring $B_{text{HT}}$ and discuss some applications to the theory of Galois representations and to $p$-adic Hodge theory. The results formalized in this paper are a prerequisite to formalize Local Class Field Theory, which is a fundamental ingredient of the proof of Fermat's Last Theorem.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127788542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Fermat's Last Theorem for regular primes 正则素数的费马大定理
International Conference on Interactive Theorem Proving Pub Date : 2023-05-15 DOI: 10.48550/arXiv.2305.08955
Alex J Best, C. Birkbeck, Riccardo Brasca, Eric Rodriguez Boidi
{"title":"Fermat's Last Theorem for regular primes","authors":"Alex J Best, C. Birkbeck, Riccardo Brasca, Eric Rodriguez Boidi","doi":"10.48550/arXiv.2305.08955","DOIUrl":"https://doi.org/10.48550/arXiv.2305.08955","url":null,"abstract":"We formalise the proof of the first case of Fermat's Last Theorem for regular primes using the emph{Lean} theorem prover and its mathematical library emph{mathlib}. This is an important 19th century result that motivated the development of modern algebraic number theory. Besides explaining the mathematics behind this result, we analyze in this paper the difficulties we faced in the formalisation process and how we solved them. For example, we had to deal with a diamond about characteristic zero fields and problems arising from multiple nested coercions related to number fields. We also explain how we integrated our work to emph{mathlib}.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123989393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MizAR 60 for Mizar 50 开刀60到开刀50
International Conference on Interactive Theorem Proving Pub Date : 2023-03-12 DOI: 10.48550/arXiv.2303.06686
Jan Jakubruv, Karel Chvalovsk'y, Z. Goertzel, C. Kaliszyk, Mirek Olvs'ak, Bartosz Piotrowski, S. Schulz, M. Suda, J. Urban
{"title":"MizAR 60 for Mizar 50","authors":"Jan Jakubruv, Karel Chvalovsk'y, Z. Goertzel, C. Kaliszyk, Mirek Olvs'ak, Bartosz Piotrowski, S. Schulz, M. Suda, J. Urban","doi":"10.48550/arXiv.2303.06686","DOIUrl":"https://doi.org/10.48550/arXiv.2303.06686","url":null,"abstract":"As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60% of the Mizar theorems in the hammer setting. We also automatically prove 75% of the Mizar theorems when the automated provers are helped by using only the premises used in the human-written Mizar proofs. We describe the methods and large-scale experiments leading to these results. This includes in particular the E and Vampire provers, their ENIGMA and Deepire learning modifications, a number of learning-based premise selection methods, and the incremental loop that interleaves growing a corpus of millions of ATP proofs with training increasingly strong AI/TP systems on them. We also present a selection of Mizar problems that were proved automatically.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Formal Analysis of RANKING 排名的形式化分析
International Conference on Interactive Theorem Proving Pub Date : 2023-02-27 DOI: 10.48550/arXiv.2302.13747
Mohammad Abdulaziz, Christoph Madlener
{"title":"A Formal Analysis of RANKING","authors":"Mohammad Abdulaziz, Christoph Madlener","doi":"10.48550/arXiv.2302.13747","DOIUrl":"https://doi.org/10.48550/arXiv.2302.13747","url":null,"abstract":"We describe a formal correctness proof of RANKING, an online algorithm for online bipartite matching. An outcome of our formalisation is that it shows that there is a gap in all combinatorial proofs of the algorithm. Filling that gap constituted the majority of the effort which went into this work. This is despite the algorithm being one of the most studied algorithms and a central result in theoretical computer science. This gap is an example of difficulties in formalising graphical arguments which are ubiquitous in the theory of computing.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131376146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reimplementing Mizar in Rust 在Rust中重新实现Mizar
International Conference on Interactive Theorem Proving Pub Date : 2023-02-27 DOI: 10.48550/arXiv.2304.08391
Mario M. Carneiro
{"title":"Reimplementing Mizar in Rust","authors":"Mario M. Carneiro","doi":"10.48550/arXiv.2304.08391","DOIUrl":"https://doi.org/10.48550/arXiv.2304.08391","url":null,"abstract":"This paper describes a new open-source proof processing tool, mizar-rs, a wholesale reimplementation of core parts of the Mizar proof system, written in Rust. In particular, the\"checker\"and\"analyzer\"of Mizar are implemented, which together form the trusted core of Mizar. This is to our knowledge the first and only external implementation of these components. Thanks to the loose coupling of Mizar's passes, it is possible to use the checker as a drop-in replacement for the original, and we have used this to verify the entire MML in 11.8 minutes on 8 cores, a 4.8x speedup over the original Pascal implementation. Since Mizar is not designed to have a small trusted core, checking Mizar proofs entails following Mizar closely, so our ability to detect bugs is limited. Nevertheless, we were able to find multiple memory errors, four soundness bugs in the original (which were not being exploited in MML), in addition to one non-critical bug which was being exploited in 46 different MML articles. We hope to use this checker as a base for proof export tooling, as well as revitalizing development of the language.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129238132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Certifying Higher-Order Polynomial Interpretations 证明高阶多项式解释
International Conference on Interactive Theorem Proving Pub Date : 2023-02-23 DOI: 10.4230/LIPIcs.ITP.2023.30
N. V. D. Weide, Deivid Vale, Cynthia Kop
{"title":"Certifying Higher-Order Polynomial Interpretations","authors":"N. V. D. Weide, Deivid Vale, Cynthia Kop","doi":"10.4230/LIPIcs.ITP.2023.30","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITP.2023.30","url":null,"abstract":"Higher-order rewriting is a framework in which one can write higher-order programs and study their properties. One such property is termination: the situation that for all inputs, the program eventually halts its execution and produces an output. Several tools have been developed to check whether higher-order rewriting systems are terminating. However, developing such tools is difficult and can be error-prone. In this paper, we present a way of certifying termination proofs of higher-order term rewriting systems. We formalize a specific method, namely the polynomial interpretation method, that is used to prove termination. In addition, we give a program that turns the output of Wanda, a termination analysis tool for higher-order rewriting systems, into a Coq script, so that we can check whether the output is a valid proof of termination.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124563364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An Elementary Formal Proof of the Group Law on Weierstrass Elliptic Curves in any Characteristic Weierstrass椭圆曲线上群律的初等形式证明
International Conference on Interactive Theorem Proving Pub Date : 2023-02-21 DOI: 10.48550/arXiv.2302.10640
David Kurniadi Angdinata, Junyan Xu
{"title":"An Elementary Formal Proof of the Group Law on Weierstrass Elliptic Curves in any Characteristic","authors":"David Kurniadi Angdinata, Junyan Xu","doi":"10.48550/arXiv.2302.10640","DOIUrl":"https://doi.org/10.48550/arXiv.2302.10640","url":null,"abstract":"Elliptic curves are fundamental objects in number theory and algebraic geometry, whose points over a field form an abelian group under a geometric addition law. Any elliptic curve over a field admits a Weierstrass model, but prior formal proofs that the addition law is associative in this model involve either advanced algebraic geometry or tedious computation, especially in characteristic two. We formalise in the Lean theorem prover, the type of nonsingular points of a Weierstrass curve over a field of any characteristic and a purely algebraic proof that it forms an abelian group.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120979916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Closure Properties of General Grammars - Formally Verified 通用语法的闭包属性-正式验证
International Conference on Interactive Theorem Proving Pub Date : 2023-02-13 DOI: 10.4230/LIPIcs.ITP.2023.15
Martin Dvorak, J. Blanchette
{"title":"Closure Properties of General Grammars - Formally Verified","authors":"Martin Dvorak, J. Blanchette","doi":"10.4230/LIPIcs.ITP.2023.15","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITP.2023.15","url":null,"abstract":"We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to show closure of the class of type-0 languages under four operations: union, reversal, concatenation, and the Kleene star. The literature mostly focuses on Turing machine arguments, which are possibly more difficult to formalize. For the Kleene star, we could not follow the literature and came up with our own grammar-based construction.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121231756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics 费雪不等式的形式化:组合学中的形式化线性代数证明技术
International Conference on Interactive Theorem Proving Pub Date : 2022-07-06 DOI: 10.48550/arXiv.2207.02728
C. Edmonds, Lawrence Charles Paulson
{"title":"Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics","authors":"C. Edmonds, Lawrence Charles Paulson","doi":"10.48550/arXiv.2207.02728","DOIUrl":"https://doi.org/10.48550/arXiv.2207.02728","url":null,"abstract":"The formalisation of mathematics is continuing rapidly, however combinatorics continues to present challenges to formalisation efforts, such as its reliance on techniques from a wide range of other fields in mathematics. This paper presents formal linear algebraic techniques for proofs on incidence structures in Isabelle/HOL, and their application to the first formalisation of Fisher's inequality. In addition to formalising incidence matrices and simple techniques for reasoning on linear algebraic representations, the formalisation focuses on the linear algebra bound and rank arguments. These techniques can easily be adapted for future formalisations in combinatorics, as we demonstrate through further application to proofs of variations on Fisher's inequality.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122017641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The Isabelle ENIGMA 伊莎贝尔ENIGMA
International Conference on Interactive Theorem Proving Pub Date : 2022-05-04 DOI: 10.48550/arXiv.2205.01981
Z. Goertzel, Jan Jakubruv, C. Kaliszyk, Miroslav Olvs'ak, Jelle Piepenbrock, J. Urban
{"title":"The Isabelle ENIGMA","authors":"Z. Goertzel, Jan Jakubruv, C. Kaliszyk, Miroslav Olvs'ak, Jelle Piepenbrock, J. Urban","doi":"10.48550/arXiv.2205.01981","DOIUrl":"https://doi.org/10.48550/arXiv.2205.01981","url":null,"abstract":"We significantly improve the performance of the E automated theorem prover on the Isabelle Sledgehammer problems by combining learning and theorem proving in several ways. In particular, we develop targeted versions of the ENIGMA guidance for the Isabelle problems, targeted versions of neural premise selection, and targeted strategies for E. The methods are trained in several iterations over hundreds of thousands untyped and typed first-order problems extracted from Isabelle. Our final best single-strategy ENIGMA and premise selection system improves the best previous version of E by 25.3% in 15 seconds, outperforming also all other previous ATP and SMT systems.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116019301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信