more from this thinker     |     more from this text


Single Idea 15353

[filed under theme 5. Theory of Logic / K. Features of Logics / 5. Incompleteness ]

Full Idea

It is a lesson of the first incompleteness theorem that consistency does not entail soundness. If we add the negation of the gödel sentence for PA as an extra axiom to PA, the result is consistent. This negation is false, so the theory is unsound.

Clarification

PA is Peano Arithmetic

Gist of Idea

The first incompleteness theorem means that consistency does not entail soundness

Source

Leon Horsten (The Tarskian Turn [2011], 04.3)

Book Ref

Horsten,Leon: 'The Tarskian Turn' [MIT 2011], p.52


The 10 ideas with the same theme [some truths of a system evade formal proof]:

We can assign a characteristic number to every single object [Leibniz]
Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel]
The undecidable sentence can be decided at a 'higher' level in the system [Gödel]
Gödel's Theorems did not refute the claim that all good mathematical questions have answers [Gödel, by Koellner]
If completeness fails there is no algorithm to list the valid formulas [Tharp]
Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P]
We have no argument to show a statement is absolutely undecidable [Koellner]
The first incompleteness theorem means that consistency does not entail soundness [Horsten]
A deductive system is only incomplete with respect to a formal semantics [Rossberg]
Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward]