Higher-order Tarski Grothendieck as a Foundation for Formal Proof
Chad Brown, Cezary Kaliszyk, Karol Pąk10th International Conference on Interactive Theorem Proving, LIPIcs 141, pp. 9:1 – 9:16, 2019.
Abstract
We formally introduce a foundation for computer verified proofs based on higher-order Tarski-Grothendieck set theory. We show that this theory has a model if a 2-inaccessible cardinal exists. This assumption is the same as the one needed for a model of plain Tarski-Grothendieck set theory. The foundation allows the co-existence of proofs based on two major competing foundations for formal proofs: higher-order logic and TG set theory. We align two co-existing Isabelle libraries, Isabelle/HOL and Isabelle/Mizar, in a single foundation in the Isabelle logical framework. We do this by defining isomorphisms between the basic concepts, including integers, functions, lists, and algebraic structures that preserve the important operations. With this we can transfer theorems proved in higher-order logic to TG set theory and vice versa. We practically show this by formally transferring Lagrange’s four-square theorem, Fermat 3-4, and other theorems between the foundations in the Isabelle framework.
BibTeX
@inproceedings{cbckkp-itp19,
author = {Chad Brown and Cezary Kaliszyk and Karol Pąk},
title = {Higher-order {T}arski {G}rothendieck as a Foundation for Formal Proof},
booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)},
year = {2019},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
pages = {9:1--9:16},
url = {https://doi.org/10.4230/LIPIcs.ITP.2019.9},
doi = {10.4230/LIPIcs.ITP.2019.9},
editor = {John Harrison and John O'Leary and Andrew Tolmach},
volume = {141},
}