Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6109Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Levin, Michael | - |
| dc.date | 2004-10-04T14:39:46Z | - |
| dc.date | 2004-10-04T14:39:46Z | - |
| dc.date | 1963-07-01 | - |
| dc.date.accessioned | 2013-10-09T02:43:01Z | - |
| dc.date.available | 2013-10-09T02:43:01Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-055 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6109 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | 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. | - |
| dc.format | 807377 bytes | - |
| dc.format | 630092 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-055 | - |
| dc.title | Primitive Recursion | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.