Logical Dilemmas

Browse all of the Salem on Literature series

Logical Dilemmas (Magill’s Literary Annual 1991-2005)

At a glance:

In 1930, shortly after receiving his Ph.D. from the University of Vienna, logician Kurt Gödel announced to friends the discovery of a formally undecidable proposition. He proved that there is a statement in the language of elementary number theory which is true but which can neither be proved true nor false. Thus, he concluded, any formal mathematical system strong enough to include elementary number theory cannot prove its own consistency.

These unexpected results, known as Gödel’s incompleteness theorems, not only ran counter to most scientists’ implicit assumptions about...

[The entire page is 1984 words long]

Join eNotes

The above is a free excerpt. Get total access to this content with the:

Lookup any word on eNotes with our dictionary. Highlight the word and press SHIFT + D for a definition, or SHIFT + T for a synonym.