Eliminating Undecidability and Incompleteness in Formal Systems

Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
OLCPOL-2
Upload history
First archival date: 2019-04-19
Latest version: 37 (2019-04-29)
View other versions
Added to PP index
2019-04-19

Total views
138 ( #40,342 of 65,546 )

Recent downloads (6 months)
18 ( #39,201 of 65,546 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.