<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.ellipticcurve.info/Category:Incompleteness_theorems/history?feed=atom</id>
	<title>Category:Incompleteness theorems - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.ellipticcurve.info/Category:Incompleteness_theorems/history?feed=atom"/>
	<link rel="alternate" type="text/html" href="https://www.ellipticcurve.info/Category:Incompleteness_theorems/history"/>
	<updated>2026-06-20T09:19:15Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.42.3</generator>
	<entry>
		<id>https://www.ellipticcurve.info/index.php?title=Category:Incompleteness_theorems&amp;diff=98&amp;oldid=prev</id>
		<title>Rational Point: categorize incompleteness</title>
		<link rel="alternate" type="text/html" href="https://www.ellipticcurve.info/index.php?title=Category:Incompleteness_theorems&amp;diff=98&amp;oldid=prev"/>
		<updated>2024-12-27T10:53:50Z</updated>

		<summary type="html">&lt;p&gt;categorize incompleteness&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Kurt Gödel dealt a death blow to David Hilbert’s program of formalizing all of mathematics. That was the equivalent then, a century earlier, of Clay Mathematics Institute’s Millennium Problems today.&lt;br /&gt;
&lt;br /&gt;
== Gödel’s first incompleteness theorem ==&lt;br /&gt;
Gödel first proved that&amp;lt;blockquote&amp;gt;In any consistent formal system of logic, there are statements which are true, but unprovable.&amp;lt;/blockquote&amp;gt;When we say “consistent,” we mean simply that the system is not self-contradictory. However Gödel used a slightly different notion of ω-consistency for technical reasons.&lt;br /&gt;
&lt;br /&gt;
== Gödel’s second incompleteness theorem ==&lt;br /&gt;
The second incompleteness theorem is a considerable sharpening of the first.&amp;lt;blockquote&amp;gt;No formal system of logic, proving its own consistency, is consistent.&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Tarski’s theorem on the undefinability of truth ==&lt;br /&gt;
Alfred Tarski proved that&amp;lt;blockquote&amp;gt;No well-formed formula exists within any consistent formal system of logic, that assigns a truth value to all well-formed formulæ with no free variables.&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Löb’s theorem ==&lt;br /&gt;
Martin Hugo Löb proved that&amp;lt;blockquote&amp;gt;If any mathematical statement is provable assuming &amp;#039;&amp;#039;a priori&amp;#039;&amp;#039; that a valid proof for it exists already, then this assumption may be formally discharged, and the statement is provable &amp;#039;&amp;#039;prima facie&amp;#039;&amp;#039; without any assumption of a pre-existing proof.&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== More ==&lt;br /&gt;
Kleene’s recursion theorems, the &amp;lt;big&amp;gt;&amp;lt;math&amp;gt;s^m_n&amp;lt;/math&amp;gt;&amp;lt;/big&amp;gt; theorem, Rogers’ fixed-point theorem, and the diagonalization lemma also pertain to this category.&lt;/div&gt;</summary>
		<author><name>Rational Point</name></author>
	</entry>
</feed>