Show simple item record

dc.contributor.authorGries, Daviden_US
dc.contributor.authorSchneider, Fred B.en_US
dc.date.accessioned2007-04-23T18:13:17Z
dc.date.available2007-04-23T18:13:17Z
dc.date.issued1998-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR98-1686en_US
dc.identifier.urihttps://hdl.handle.net/1813/7340
dc.description.abstractInference rule "substitution of equals for equals" has been formalized in terms of simple substitution (which performs a replacement even though a free occurrence of a variable is captured), contextual substitution (which prevents such capture), and function application. We show that in connection with pure first-order predicate calculus, the function-application and no-capture versions of the inference rule are the same and are weaker than the capture version. We discuss the deductive apparatus needed for the no-capture version to be as powerful as the capture version.en_US
dc.format.extent184499 bytes
dc.format.extent334736 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleFormalizations Of Substitution Of Equals For Equalsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics