Eliminating Undecidability and Incompleteness in Formal Systems

Abstract

To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.

Other Versions

No versions found

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.

Analytics

Added to PP
2019-04-19

Downloads
964 (#22,063)

6 months
370 (#5,005)

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

Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).

Add more references