Theorem Proving in Higher Order Logics
From MaRDI portal
Publication:5477658
DOI10.1007/11541868zbMath1152.68531OpenAlexW2484880499MaRDI QIDQ5477658
Publication date: 6 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11541868
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
A FORMAL PROOF OF THE KEPLER CONJECTURE ⋮ Flyspeck II: The basic linear programs ⋮ Canonical Big Operators ⋮ Generating certified code from formal proofs: a case study in homological algebra ⋮ Linear quantifier elimination ⋮ A formalization of convex polyhedra based on the simplex method ⋮ Formalization of function matrix theory in HOL ⋮ Point-Free, Set-Free Concrete Linear Algebra ⋮ A formalization of the Smith normal form in higher-order logic
Uses Software
This page was built for publication: Theorem Proving in Higher Order Logics
