Primitive Recursion
| dc.date.accessioned | 2004-10-04T14:39:46Z | |
| dc.date.accessioned | 2018-11-24T10:11:57Z | |
| dc.date.available | 2004-10-04T14:39:46Z | |
| dc.date.available | 2018-11-24T10:11:57Z | |
| dc.date.issued | 1963-07-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6109 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6109 | |
| dc.description.abstract | This is one of a series of memos concerning a logical system for proof-checking. It is not self-contained, but belongs with future memos which will describe a complete formal system with its intended interpretation and application. This memo also assumes familiarity with LISP and with "A Basis for a Mathematical Theory of Computation" by John McCarthy. | en_US |
| dc.format.extent | 807377 bytes | |
| dc.format.extent | 630092 bytes | |
| dc.language.iso | en_US | |
| dc.title | Primitive Recursion | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-055.pdf | 630.0Kb | application/pdf | View/ |
| AIM-055.ps | 807.3Kb | application/postscript | View/ |