Set Theory and Logic

   

Refutation of Tarski's Undefinability of Truth Theorem © Copyright 2018 by Colin James III All Rights Reserved.

Authors: Colin James III

This refutes Tarski's theorem for the undefinability of truth as: "no definable and sound extension of Peano Arithmetic can be complete"; or in abstract terms, "the proof of a system cannot be demonstrated by itself". Tarski's theorem is an arguable equivalent to Godel's incompleteness theorem, as based on the liar's paradox. [Remark added later: Tarski's theorem as used since about 1936 is an underpinning of quantum theory and a universal justification for atheism.]

Comments: 1 Page. © Copyright 2018 by Colin James III All rights reserved.

Download: PDF

Submission history

[v1] 2018-02-14 06:16:03

Unique-IP document downloads: 27 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus