more on this theme     |     more from this thinker


Single Idea 9188

[filed under theme 5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic ]

Full Idea

Gödel proved the completeness of standard formalizations of first-order logic, including Frege's original one. However, an implication of his famous theorem on the incompleteness of arithmetic is that second-order logic is incomplete.

Gist of Idea

Gödel proved that first-order logic is complete, and second-order logic incomplete

Source

report of Kurt Gödel (works [1930]) by Michael Dummett - The Philosophy of Mathematics 3.1

Book Ref

'Philosophy 2: further through the subject', ed/tr. Grayling,A.C. [OUP 1998], p.136


A Reaction

This must mean that it is impossible to characterise arithmetic fully in terms of first-order logic. In which case we can only characterize the features of abstract reality in general if we employ an incomplete system. We're doomed.


The 6 ideas from 'works'

For clear questions posed by reason, reason can also find clear answers [Gödel]
Gödel proved that first-order logic is complete, and second-order logic incomplete [Gödel, by Dummett]
Originally truth was viewed with total suspicion, and only demonstrability was accepted [Gödel]
Gödel's Theorems did not refute the claim that all good mathematical questions have answers [Gödel, by Koellner]
Gödel eventually hoped for a generalised completeness theorem leaving nothing undecidable [Gödel, by Koellner]
The real reason for Incompleteness in arithmetic is inability to define truth in a language [Gödel]