DeepAI AI Chat

Isabelle's Metalogic: Formalization and Proof Checker

04/25/2021

∙

by Tobias Nipkow, et al.

∙

∙

Isabelle is a generic theorem prover with a fragment of higher-order logic as a metalogic for defining object logics. Isabelle also provides proof terms. We formalize this metalogic and the language of proof terms in Isabelle/HOL, define an executable (but inefficient) proof term checker and prove its correctness w.r.t. the metalogic. We integrate the proof checker with Isabelle and run it on a range of logics and theories to check the correctness of all the proofs in those theories.

Tobias Nipkow
8 publications
Simon Roßkopf
1 publication

page 1

page 2

page 3

page 4

∙ 04/14/2022

Normalisation for Some Infectious Logics and Their Relatives

We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) and se...

0 Yaroslav Petrukhin, et al. ∙

∙ 03/18/2019

Working with first-order proofs and provers

Verifying software correctness has always been an important and complica...

0 Michael Raskin, et al. ∙

∙ 07/27/2018

Limits with Signed Digit Streams

We work with the signed digit representation of abstract real numbers, w...

0 Franziskus Wiesnet, et al. ∙

∙ 04/28/2022

Generic Dijkstra: correctness and tractability

The recently-proposed generic Dijkstra algorithm finds shortest paths in...

0 Ireneusz Szcześniak, et al. ∙

∙ 08/29/2023

Sharing proofs with predicative theories through universe polymorphic elaboration

As the development of formal proofs is a time-consuming task, it is impo...

0 Thiago Felicissimo, et al. ∙

∙ 10/14/2020

Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA (Full Paper)

Modern separation logics allow one to prove rich properties of intricate...

0 Felix A. Wolf, et al. ∙

∙ 05/10/2021

No speedup for geometric theories

Geometric theories based on classical logic are conservative over their ...

0 Michael Rathjen, et al. ∙