Неразрешимост на първата теорема за непълнотата. Гьоделова и Хилбертова математика

Philosophical Alternatives 19 (5):104-119 (2010)
  Copy   BIBTEX

Abstract

Can the so-ca\led first incompleteness theorem refer to itself? Many or maybe even all the paradoxes in mathematics are connected with some kind of self-reference. Gбdel built his proof on the ground of self-reference: а statement which claims its unprovabllity. So, he demonstrated that undecidaЬle propositions exist in any enough rich axiomatics (i.e. such one which contains Peano arithmetic in some sense). What about the decidabllity of the very first incompleteness theorem? We can display that it fulfills its conditions. That's why it can Ье applied to itself, proving that it is an undecidaЬle statement. It seems to Ье а too strange kind of proposition: its validity implies its undecidabllity. If the validity of а statement implies its untruth, then it is either untruth (reductio ad absurdum) or an antinomy (if also its negation implies its validity). А theory that contains а contradiction implies any statement. Appearing of а proposition, whose validity implies its undecidabllity, is due to the statement that claims its unprovability. Obviously, it is а proposition of self-referential type. Ву Gбdel's words, it is correlative with Richard's or liar paradox, or even with any other semantic or mathematical one. What is the cost, if а proposition of that special kind is used in а proof? ln our opinion, the price is analogous to «applying» of а contradictory in а theory: any statement turns out to Ье undecidaЬ!e. Ifthe first incompleteness theorem is an undecidaЬ!e theorem, then it is impossiЬle to prove that the very completeness of Peano arithmetic is also an tmdecidaЬle statement (the second incompleteness theorem). Hilbert's program for ап arithmetical self-foundation of matheшatics is partly rehabllitated: only partly, because it is not decidaЬ!e and true, but undecidaЬle; that's wby both it and its negation шау Ье accepted as true, however not siшultaneously true. The first incompleteness theoreш gains the statute of axiom of а very special, semi-philosophical kind: it divides mathematics as whole into two parts: either Godel шathematics or Нilbert matheшatics. Нilbert's program of self-foundation ofmatheшatic is valid only as to the latter.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Mathematical instrumentalism, Gödel’s theorem, and inductive evidence.Alexander Paseau - 2011 - Studies in History and Philosophy of Science Part A 42 (1):140-149.
Kurt Gödel, paper on the incompleteness theorems (1931).Richard Zach - 2004 - In Ivor Grattan-Guinness (ed.), Landmark Writings in Mathematics. North-Holland. pp. 917-925.
The Liar Syndrome.Albert A. Johnstone - 2002 - SATS 3 (1):37-55.
Finitism: An Essay on Hilbert's Programme.David Watson Galloway - 1991 - Dissertation, Massachusetts Institute of Technology
Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.
Is Mathematics Problem Solving or Theorem Proving?Carlo Cellucci - 2017 - Foundations of Science 22 (1):183-199.
Godel's theorem in retrospect.Martin Tabakov - 1984 - Bulletin of the Section of Logic 13 (3):132-134.

Analytics

Added to PP
2020-06-14

Downloads
220 (#88,149)

6 months
61 (#69,986)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Vasil Penchev
Bulgarian Academy of Sciences

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references