Fallacious Presuppositions in Gödel's Indecidability Theorem
Fallacious Presuppositions in Gödel's Indecidability Theorem

Summary/Abstract: One of the famous achievement of contemporary logic was K. Gödel's argumentation that the axiomatic systems which contain arithmetic, (like the Russell and Whitehead's system in Principia Mathematica), if they are consistent, then they are also indecidable. This result was interpreted against logicism, as the foundation of mathematics program, which proposes just to embed the arithmetic in a logical system.

• Details
• Contents