Tarski Undefinability Theorem Succinctly Refuted

Abstract

If the conclusion of the Tarski Undefinability Theorem was that some artificially constrained limited notions of a formal system necessarily have undecidable sentences, then Tarski made no mistake within his assumptions. When we expand the scope of his investigation to other notions of formal systems we reach an entirely different conclusion showing that Tarski's assumptions were wrong.

Author's Profile

Analytics

Added to PP
2019-04-02

Downloads
431 (#35,647)

6 months
177 (#13,515)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?