Edinburgh Research Archive logo

Edinburgh Research Archive

University of Edinburgh homecrest
View Item 
  •   ERA Home
  • Informatics, School of
  • Informatics Report Series
  • View Item
  •   ERA Home
  • Informatics, School of
  • Informatics Report Series
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

The Automation Of Proof By Mathematical Induction

View/Open
0002.pdf (501.6Kb)
Date
04/1999
Author
Bundy, Alan
Metadata
Show full item record
Abstract
This paper is a chapter of the Handbook of Automated Reasoning edited by Voronkov and Robinson. It describes techniques for automated reasoning in theories containing rules of mathematical induction. Firstly, inductive reasoning is defined and its importance fore reasoning about any form of repitition is stressed. Then the special search problems that arise in inductive theories are explained followed by descriptions of the heuristic methods that have been devised to solve these problems.
URI
http://hdl.handle.net/1842/3394
Collections
  • Informatics Report Series

Library & University Collections HomeUniversity of Edinburgh Information Services Home
Privacy & Cookies | Takedown Policy | Accessibility | Contact
Privacy & Cookies
Takedown Policy
Accessibility
Contact
feed RSS Feeds

RSS Feed not available for this page

 

 

All of ERACommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsPublication TypeSponsorSupervisorsThis CollectionBy Issue DateAuthorsTitlesSubjectsPublication TypeSponsorSupervisors
LoginRegister

Library & University Collections HomeUniversity of Edinburgh Information Services Home
Privacy & Cookies | Takedown Policy | Accessibility | Contact
Privacy & Cookies
Takedown Policy
Accessibility
Contact
feed RSS Feeds

RSS Feed not available for this page