Norrish, Michael

Xu, Yiming

English

We describe a new meta-logical system for mechanising foundations of mathematics. Using dependent sorts and first order logic, our system (implemented as an LCF-style theorem-prover) improves on the state-of-the-art by providing efficient type-checking, convenient automatic rewriting and interactive proof support. We assess our implementation by axiomatising Lawvere’s Elementary Theory of the Category of Sets (ETCS) [F. William Lawvere, 1964], and Shulman’s Sets, Elements and Relations (SEAR) [Michael Shulman, 2022]. We then demonstrate our system’s ability to perform some basic mathematical constructions such as quotienting, induction and coinduction by constructing integers, lists and colists. We also compare with some existing work on modal model theory done in HOL4 [Yiming Xu and Michael Norrish, 2020]. Using the analogue of type-quantification, we are able to prove a theorem that this earlier work could not. Finally, we show that SEAR can construct sets that are larger than any finite iteration of the power set operation. This shows that SEAR, unlike HOL, can construct sets beyond V_{ω+ω}

DROPS Dagstuhl Research Online Publication Server

Dependently Sorted Theorem Proving for Mathematical Foundations

https://drops.dagstuhl.de/opus/volltexte/2023/18408/pdf/LIPIcs-ITP-2023-33.pdf

Dependently Sorted Theorem Proving for Mathematical Foundations

Abstract

Similar works

Full text

Available Versions

DROPS Dagstuhl Research Online Publication Server