Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.date.accessioned2007-04-23T16:43:26Z
dc.date.available2007-04-23T16:43:26Z
dc.date.issued1982-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-485en_US
dc.identifier.urihttps://hdl.handle.net/1813/6325
dc.description.abstractIn this note we discuss the similarities and differences between Goedel's result about non-recursive shortening of proofs of formal systems by additional axioms and the corresponding results about the succinctness of different representations of languages.en_US
dc.format.extent620814 bytes
dc.format.extent147839 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.titleOn Goedel Speed-Up and Succinctness of Language Representationen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics