Skip to content

Reconstructing SMT Proofs in the λ Π / ≡ -calculus

· 0 citations · 24 references

TL;DR

This work develops a reconstruction pipeline from the Alethe proof format, produced by cvc5, to Lambdapi, a proof assistant for the λ Π / ≡ - calculus, and provides an encoding of the SMT-LIB logic in Lambdapi, certify a substantial fragment of the Alethe inference rules.

View source

Similar papers

Proof Production for Satisfiability Modulo Finite Fields with Proof Checking in Pacheck and Lean

This work proposes a proof calculus that captures the decision procedure for finite field reasoning employed by the SMT solver CVC 5 and instrumenting the solver to generate proofs within this calculus, and introduces an extension of the Practical Algebraic Calculus that mirrors the proposed system.

Pedro Saccomani, Abdalrhman Mohamed, Elizaveta Pertseva et al. · 0 citations

A light-weight proof checker for TSTP refutations

A proof checker called Nörgler is introduced that builds upon and extends the established approach pioneered by GDV and supports checking propositional, (untyped and typed) first-order, and higher-order refutations represented in TSTP.

Melanie Taprogge, H. Sariyanto, Alexander Steen · 1 citation
Review Aug 2026

Isabelle/STARK: A Formalization of zk-STARK in Isabelle/HOL

This report presents mechanized query-bounded soundness for a STARK-style protocol in Isabelle/HOL with fixed-statement results in a classical, field-valued random-oracle model with terminating finite-support computation, not an unrestricted 137-bit work-factor guarantee.

Diego Marmsoler · 0 citations
2026

Treating Congruences as Equalities Within Proofs

This paper provides a setting in which congruences can be treated as actual equalities, mirroring the informal practice of mathematicians and eliminating the need to use the lemmas typically required for formal congruence proofs.

Dale A. Miller · 0 citations
Review Jul 2026

Verification of Provers and Solvers

This chapter reviews and compares the approaches available, and mentions several successful applications of automatic deduction tools connected to proof assistants using various approaches.

René Thiemann · 0 citations
Preprint Sep 2026

Towards a Proof-Theoretic Analysis of Incorrect/Incomplete Proofs

It is shown that the epsilon calculus provides a natural framework for analyzing tolerance of falsity in proofs and for identifying conditions under which an incorrect proof can be semantically repaired.

Matthias Baaz, Mariami Gamsakhurdia · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.