The Prolog Inference Model refutes Tarski Undefinability

Download Edit this record How to cite View on PhilPapers
The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal systems.
PhilPapers/Archive ID
Revision history
Archival date: 2019-04-13
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
7 ( #39,014 of 38,956 )

Recent downloads (6 months)
7 ( #33,626 of 38,956 )

How can I increase my downloads?

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