{"type":"ScholarlyArticle","title":"Computer Proofs of Limit Theorems","authors":[{"name":"W. W. Bledsoe","slug":"w-w-bledsoe","given":"W. W.","family":"Bledsoe","affiliation":""},{"name":"Robert S. Boyer","slug":"robert-s-boyer","given":"Robert S.","family":"Boyer","affiliation":""},{"name":"William H. Henneman","slug":"william-h-henneman","given":"William H.","family":"Henneman","affiliation":""}],"abstract":"Some relatively simple concepts have been developed which, when incorporated into existing automatic theorem proving programs (including those using resolution), enable them to prove efficiently a number of the limit theorems of elementary calculus, including the theorem that differentiable functions are continuous. These concepts include: (1) A limited theory of types, to designate whether a given variable belongs to a certain interval on the real line, (2) An algebraic simplification routine, (3) A routine for solving linear inequalities, applicable to all areas of analysis, and (4) A \"limit heuristic\", designed especially for the limit theorems of calculus .","doi":null,"url":"https://ijcai.org/proceedings/1971/61","pdf":"https://ijcai.org/proceedings/1971/0061.pdf","markdown":"https://ijcai.org/proceedings/1971/61.md","bibtex":"https://ijcai.org/proceedings/1971/bibtex/61","volume":{"slug":"1971","title":"Proceedings of the Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1971","url":"https://ijcai.org/proceedings/1971/","year":1971,"location":"London, UK","dates":"","editors":"D.C. Cooper","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":61,"pages":{"first":586,"last":599},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}