Theorem Proving in Higher Order Logics

DOI10.1007/11541868zbMath1152.68526OpenAlexW2484880499MaRDI QIDQ5477668

J. Strother Moore, Qiang Zhang

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms ⋮ Certifying algorithms ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets

Uses Software

• ACL2

This page was built for publication: Theorem Proving in Higher Order Logics