Show simple item record

dc.contributor.authorNorton, Lewis M.en_US
dc.date.accessioned2004-10-04T14:39:23Z
dc.date.available2004-10-04T14:39:23Z
dc.date.issued1962-01-01en_US
dc.identifier.otherAIM-037en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6100
dc.descriptionRevised March 1962en_US
dc.description.abstractThe purpose of this paper is two-fold; 1) to explore the use of recursion induction in proving theorem about functions of symbolic expressions, in particular. 2) to investigate thoroughly the algebraic properties of the LISP function subst [x; y; z] by this method. The main result is embodied in Theorem 8.en_US
dc.format.extent2697815 bytes
dc.format.extent2120354 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-037en_US
dc.titleSome Identities Concerning the Function Subst [x; y; z]en_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record