Proof that Wittgenstein is correct about Gödel

Abstract

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic property of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide valid the deductive inference. Conclusions of sound arguments are derived from truth preserving finite string transformations applied to true premises.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

The gödel paradox and Wittgenstein's reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
On Gödel Sentences and What They Say.Peter Milne - 2007 - Philosophia Mathematica 15 (2):193-226.
Heterologicality and Incompleteness.Cezary Cieśliński - 2002 - Mathematical Logic Quarterly 48 (1):105-110.
On some much maligned remarks of Wittgenstein on gödel.Charles Sayward - 2001 - Philosophical Investigations 24 (3):262–270.
Undefinability of truth. the problem of priority:tarski vs gödel.Roman Murawski - 1998 - History and Philosophy of Logic 19 (3):153-160.
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.

Analytics

Added to PP
2019-06-20

Downloads
662 (#25,461)

6 months
188 (#15,605)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Universal grammar.Richard Montague - 1970 - Theoria 36 (3):373--398.
Foundations of mathematical logic.Haskell Brooks Curry - 1963 - New York: Dover Publications.

Add more references