dc.creator | Bledsoe, W.W. | |
dc.creator | Boyer, Robert S. | |
dc.creator | Henneman, William H. | |
dc.date | 2004-10-04T14:45:19Z | |
dc.date | 2004-10-04T14:45:19Z | |
dc.date | 1971-06-01 | |
dc.date.accessioned | 2013-10-09T02:44:00Z | |
dc.date.available | 2013-10-09T02:44:00Z | |
dc.date.issued | 2013-10-09 | |
dc.identifier | AIM-217 | |
dc.identifier | http://hdl.handle.net/1721.1/6191 | |
dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | |
dc.description | In this paper we describe some relatively simple changes that have been made to an existing automatic theorem proving program to enable it to prove efficiently a number of the limit theorems of elementary calculus. These changes include subroutines of a general nature which apply to all areas of analysis , and a special "limit-heuristic" design for the limit theorems of calculus. | |
dc.format | 22804096 bytes | |
dc.format | 1162044 bytes | |
dc.format | application/postscript | |
dc.format | application/pdf | |
dc.language | en_US | |
dc.relation | AIM-217 | |
dc.title | Computer Proofs of Limit Theorems |
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |