Abstract

In this paper we deal with the problem of proving inductive theorems in conditional equational theories. We propose a proof by consistency method that can be employed when the theory is representable as a ground Church-Rosser conditional equational system. The method has a linear proof strategy and is shown to be sound and refutational complete, i.e. it refutes any conditional equation which is not an inductive theorem. Moreover it can handle rewrite rules as well as (unorientable) equations and therefore it will not fail when an unorientable equation comes up (as was the case in the earliest proof by consistency (inductionless induction) methods). The method extends the work on unconditional equational theories of [Bachmair 1988].

Full Text
Paper version not known

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 call

Disclaimer: 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.