On Goedel Speed-Up and Succinctness of Language Representation
Loading...
No Access Until
Permanent Link(s)
Other Titles
Author(s)
Abstract
In 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.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1982-03
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-485
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report