Generating mutually inductive theorems from concise descriptions

DOI10.4204/EPTCS.327.10MaRDI QIDQ6591498zbMATH OpenFDO

Authors Sol Swords

Publication date 22 August 2024

Full work available at URL https://doi.org/10.4204/EPTCS.327.10

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• scientific article; zbMATH DE number 1696825
• Induction using term orderings
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• A macro for reusing abstract functions and theorems
• Automated mutual induction proof in separation logic

Cited in

(1)

• A macro for reusing abstract functions and theorems

This page was built for publication: Generating mutually inductive theorems from concise descriptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591498)