Isabelle's Metalogic: Formalization and Proof Checker

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

In this entry we formalize Isabelle's metalogic in Isabelle/HOL. Furthermore, we define a language of proof terms and an executable proof checker and prove its soundness wrt. the metalogic. The formalization is intentionally kept close to the Isabelle implementation(for example using de Brujin indices) to enable easy integration of generated code with the Isabelle system without a complicated translation layer. The formalization is described in our CADE 28 paper.

License

BSD License

Topics

Logic/General logic

Related publications

Nipkow, T., & Roßkopf, S. (2021). Isabelle’s Metalogic: Formalization and Proof Checker. Automated Deduction – CADE 28, 93–110. https://doi.org/10.1007/978-3-030-79876-5_6
Roßkopf, S., & Nipkow, T. (2022). A Formalization and Proof Checker for Isabelle’s Metalogic. Journal of Automated Reasoning, 67(1). https://doi.org/10.1007/s10817-022-09648-w

Session Metalogic_ProofChecker

Depends on

List Index