Computer Proofs of Limit Theorems
| dc.contributor.author | Bledsoe, W.W. | en_US |
| dc.contributor.author | Boyer, Robert S. | en_US |
| dc.contributor.author | Henneman, William H. | en_US |
| dc.date.accessioned | 2004-10-04T14:45:19Z | |
| dc.date.available | 2004-10-04T14:45:19Z | |
| dc.date.issued | 1971-06-01 | en_US |
| dc.identifier.other | AIM-217 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6191 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 22804096 bytes | |
| dc.format.extent | 1162044 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | AIM-217 | en_US |
| dc.title | Computer Proofs of Limit Theorems | en_US |
