The Formalization Of Vickrey Auctions: A Comparison Of Two Approaches In Isabelle And Theorema

INTELLIGENT COMPUTER MATHEMATICS(2017)

引用 1|浏览0
暂无评分
摘要
In earlier work presented at CICM, four theorem provers (Isabelle, Mizar, Hets/CASL/TPTP, and Theorema) were compared based on a case study in theoretical economics, the formalization of the landmark Theorem of Vickrey in auction theory. At the time of this comparison the Theorema system was in a state of transition: The original Theorema system (Theorema 1) had been shut down by the Theorema group and the successor system Theorema 2.0 was just about to be launched. Theorema 2.0 participated in the competition, but only parts of the system were ready for use. In particular, the new reasoning engines had not been set up, so that some of the results in the system comparison had to be extrapolated from experience we had with Theorema 1. In this paper, we now want to compare a complete formalization of Vickrey's Theorem in Theorema 2.0 with the original formalization in Isabelle. On the one hand, we compare the mathematical setup of the two theories and, on the other hand, we also give an overview on statistical indicators, such as number of auxiliary lemmas and the total number of proof steps needed for all proofs in the theory. Last but not least, we present a shorter version of proof of the main theorem in Isabelle.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要