About: Gödel's speed-up theorem

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Gödel's speed-up theorem Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In mathematics, Gödel's speed-up theorem, proved by Gödel, shows that there are theorems whose proofs can be drastically shortened by working in more powerful axiomatic systems. Kurt Gödel showed how to find explicit examples of statements in formal systems that are provable in that system but whose shortest proof is unimaginably long. For example, the statement: "This statement cannot be proved in Peano arithmetic in fewer than a googolplex symbols"

Attributes	Values
rdfs:label	Gödel's speed-up theorem (en)
rdfs:comment	In mathematics, Gödel's speed-up theorem, proved by Gödel, shows that there are theorems whose proofs can be drastically shortened by working in more powerful axiomatic systems. Kurt Gödel showed how to find explicit examples of statements in formal systems that are provable in that system but whose shortest proof is unimaginably long. For example, the statement: "This statement cannot be proved in Peano arithmetic in fewer than a googolplex symbols" (en)
sameAs	Gödel's speed-up theorem
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Harv dbt:Harvs dbt:Short_description
Subject	Proof theory Works by Kurt Gödel Theorems in the foundations of mathematics
gold:hypernym	Theorems
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Gödel's_speed-up_theorem?oldid=1047706640&ns=0
Wikipage page ID	33111104 (xsd:integer)
page length (characters) of wiki page	4228 (xsd:nonNegativeInteger)
Wikipage revision ID	1047706640 (xsd:integer)
Link from a Wikipage to another Wikipage	Blum's speedup theorem Proof theory Works by Kurt Gödel Kruskal's tree theorem Kurt Gödel Second-order arithmetic List of long mathematical proofs Names of large numbers Graph embedding Theorems in the foundations of mathematics Gödel's incompleteness theorems Harvey Friedman Peano axioms
has abstract	In mathematics, Gödel's speed-up theorem, proved by Gödel, shows that there are theorems whose proofs can be drastically shortened by working in more powerful axiomatic systems. Kurt Gödel showed how to find explicit examples of statements in formal systems that are provable in that system but whose shortest proof is unimaginably long. For example, the statement: "This statement cannot be proved in Peano arithmetic in fewer than a googolplex symbols" is provable in Peano arithmetic (PA) but the shortest proof has at least a googolplex symbols, by an argument similar to the proof of Gödel's first incompleteness theorem: If PA is consistent, then it cannot prove the statement in fewer than a googolplex symbols, because the existence of such a proof would itself be a theorem of PA, a contradiction. But simply enumerating all strings of length up to a googolplex and checking that each such string is not a proof (in PA) of the statement, yields a proof of the statement (which is necessarily longer than a googolplex symbols). The statement has a short proof in a more powerful system: in fact the proof given in the previous paragraph is a proof in the system of Peano arithmetic plus the statement "Peano arithmetic is consistent" (which, per the incompleteness theorem, cannot be proved in Peano arithmetic). In this argument, Peano arithmetic can be replaced by any more powerful consistent system, and a googolplex can be replaced by any number that can be described concisely in the system. Harvey Friedman found some explicit natural examples of this phenomenon, giving some explicit statements in Peano arithmetic and other formal systems whose shortest proofs are ridiculously long. For example, the statement "there is an integer n such that if there is a sequence of rooted trees T1, T2, ..., Tn such that Tk has at most k+10 vertices, then some tree can be homeomorphically embedded in a later one" is provable in Peano arithmetic, but the shortest proof has length at least A(1000), where A(0)=1 and A(n+1)=2A(n). The statement is a special case of Kruskal's theorem and has a short proof in second order arithmetic. If one takes Peano arithmetic together with the negation of the statement above, one obtains an inconsistent theory whose shortest known contradiction is equivalently long. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Gödel's_speed-up_theorem
is Wikipage redirect of	Godel's speed-up theorem Gödel's speed up theorem Gödel's speedup theorem Godel's speed up theorem Godel's speedup theorem
is Link from a Wikipage to another Wikipage of	Blum's speedup theorem Godel's speed-up theorem Kurt Gödel Gödel's speed up theorem Gödel's incompleteness theorems Gödel's speedup theorem Gödel's theorem Godel's speed up theorem Godel's speedup theorem
is known for of	Kurt Gödel
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Gödel's_speed-up_theorem

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software