Eliminating Undecidability and Incompleteness in Formal Systems (by making Formal Systems correspond to the Sound Deductive Inference model)

Download Edit this record How to cite View on PhilPapers
Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. An alternative that corrects the shortcomings of the conventional notion of formal systems is provided that totally eliminates incompleteness and undecidability from all formal systems capable of directly expressing a provability predicate (thus without diagonalization).
(categorize this paper)
PhilPapers/Archive ID
Revision history
First archival date: 2019-04-15
Latest version: 32 (2019-04-19)
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index

Total views
8 ( #38,710 of 38,850 )

Recent downloads (6 months)
8 ( #32,271 of 38,850 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.