DeepAI AI Chat
Log In Sign Up

Isabelle's Metalogic: Formalization and Proof Checker

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.


page 1

page 2

page 3

page 4


Normalisation for Some Infectious Logics and Their Relatives

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

Working with first-order proofs and provers

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

Limits with Signed Digit Streams

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

Generic Dijkstra: correctness and tractability

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

Sharing proofs with predicative theories through universe polymorphic elaboration

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

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...

No speedup for geometric theories

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