Abstract
We study proofs by structural induction and the equational subproofs that emerge from inductive proofs. Due to the role these subproofs play in the proof process, existing theorem provers tend to use ad hoc methods rather than existing semi-decision methods for equational proofs. We present a formalized version of these ad hoc methods, and prove some results on its completeness. Finally we present some examples on the formalized method used in fully automatized proofs by structural induction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
