# Kurt Gödel: from loopholes and dictators to the incompleteness theorems

Mark Colyvan: The recent events surrounding Donald Trump’s first few weeks in the White House have left many wondering how a political outsider can become president of the United States.

Does Trump’s rapid rise to the presidency mark a change in how election campaigns will be conducted? Is it possible to have a president who does not believe in the traditional conventions of governance and democracy? Could the United States even end up with a dictator?

The last of these questions is particularly interesting. Answering it would involve a careful study of the US constitution which, according to legend, was done by the great Austrian mathematician and logician Kurt Gödel.

## The ‘loophole’

As the story goes, Gödel was preparing for his US citizenship examination in 1947 when he claimed to have found a “loophole” in the constitution that allowed the US to elect a dictator. The actual loophole was never explained and has been the focus of much study and speculation ever since.

Gödel was accompanied to his citizenship examination by his good friends Albert Einstein (yes, the famous physicist) and economist Oskar Morgenstern (one of the founders of game theory).

They tried to discourage him from discussing dictators and loopholes, but Gödel couldn’t help himself and told the citizenship examiner about the discovery. Gödel did receive his US citizenship, thanks in part to Morgenstern’s and Einstein’s endorsement.

There is reason for scepticism about some of the details of this story but if there’s one thing we’ve learned from the recent US election, it’s this: never let the truth get in the way of a convenient fiction.

In any case, the Gödel story is at least plausible. He spent a great deal of time thinking about systems of rules (axiom systems in mathematics), and looking for their limits and what such systems can say about themselves.

## The incompleteness theorems

His most famous results – his celebrated incompleteness theorems published in 1931 – show that mathematics cannot prove every true mathematical sentence. In particular, it cannot prove its own consistency. Mathematics cannot prove that it is not internally contradictory, unless it is, in fact, inconsistent.

The idea is roughly this. Consider the sentence “this sentence is not provable”. If you prove it, you’ve proved something false because of what the sentence says. So it must not be provable.

But, then, what it says is true, so there’s something that is true but not provable.

There is much more to Gödel’s incompleteness theorems than this, but this is the core idea: you turn the system back on itself in a kind of loop to reveal its own limitations.

These results were – and still are – big news. In effect, they show that there are blind spots in mathematics, things mathematics cannot prove but can nevertheless be recognised to be true.

## Mind vs computer

Put this way, Gödel’s results lead to a very natural thought – elaborated on by the philosopher J R Lucas and the mathematician and physicist Roger Penrose – that the human mind is not a flesh-and-blood computer.

The idea is that purely mechanical, rule-governed methods, such as those found in mathematics and computers, cannot see the blind spot noted by Gödel, but the human mind can see it. So there’s something the human mind can do that computers can’t.

This Lucas and Penrose thesis is interesting but it is ultimately flawed, for technical reasons I won’t go into here. But I offer it as just one of the many possible applications of, and interesting discussions revolving around, Gödel’s incompleteness theorems.

In later work Gödel turned to an important mathematical conjecture about the size of one of the most important collection of numbers in all of mathematics: the set of real numbers, which comprises the natural (counting) numbers, fractions, numbers such as the square root of 2, and the transcendental numbers such as π and *e*.

It is straightforward to prove that there are more real numbers than natural numbers, even though there are infinitely many of each.

## Playing with numbers

A very natural question is: how much bigger is the set of real numbers? An important conjecture on this issue, known as the continuum hypothesis, was advanced in the 1870s by the German mathematician Georg Cantor, the founding father of set theory, the branch of mathematics that deals with defined collections of objects.

In 1940 Gödel proved that the continuum hypothesis is consistent with the standard theory of sets. Later, in the 1960s, it was proved that the negation of the continuum hypothesis is also consistent with the standard theory of sets.

Taken together, these two results show that mathematics is silent on a very important mathematical issue. The question of how many real numbers there are is undecidable, at least in standard set theory.

A common thread in much of Gödel’s work is loops. He even looked at solutions to Einstein’s equations of general relativity and found that the equations allowed for closed time-like loops, or “time travel solutions”.

It should come as no surprise that when encouraged to look at the US constitution (which is, after all, just a set of rules), Gödel was enthusiastic and his thoughts turned immediately to what the system said about itself – and its limitations. It should also come as no surprise then that when he looked, he found some.

Mark Colyvan, Professor of Philosophy, *University of Sydney*

This article was originally published on The Conversation. Read the original article.