Lexicon of Arguments

Philosophical and Scientific Issues in Dispute

Complaints - Corrections

Sc. Camps
Theses I
Theses II


What is wrong?
Other metadata
Excerpt or content

Correction: Year / Place / Page
/ /

(max 500 charact.)

Your username*
or User-ID

Email address*

Captcha Code-Check*
Captcha Code
Please type the captcha code here.

Bad visibility? generate code again.

The complaint
will not be published.


Berka I 331
Undecidability/Predicate calculus 1st level/Gödel: Gödel shows with "Arithmetication" ("Gödelisation") that the predicate calculus of the 1st level is undecidable.
This was a shocking fact for the Hilbert program.
Tarski: (1939) Tarski proved the undecidability of Principia Mathematica and related systems. He showed that it is fundamental, i.e. that it cannot be abolished.
Rosser: Rosser generalized Gödel's proof by replacing the condition of the ω-consistency by that of simple consistency.

Found an error? Use our Complaint Form. Perhaps someone forgot to close a bracket? A page number is wrong?
Help us to improve our lexicon.
However, if you are of a different opinion, as regards the validity of the argument, post your own argument beside the contested one.
The correction will be sent to the contributor of the original entry to get his opinion about.