Abstract
We approach the problem of finding witnessing terms in proofs by the method of meta-variables. We describe an efficient method for handling meta-variables in natural style proofs and its implementation in the TH∃OREM∀ system. The method is based on a special technique for finding meta-substitutions when the proof search is performed in an AND-OR deduction tree. The implementation does not depend on the search strategy and allows easy integration with various special provers as well as with special unification/solving engines. We demonstrate the use of this method in the context of a special forward/backward inference strategy for producing proofs in elementary analysis. Bibliography: 28 titles.
Sign-in/Register to access full text options 
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.
