Set Theory and Logic


Refutation of Turing's Halting Problem as Logically Unsolvable

Authors: Colin James III

We confirm the halting conjecture as tautologous and hence refute the halting problem as unsolvable. What follows is that first order logic is decidable. This proof was made possible by the universal logic VL4.

Comments: Pages.

Download: PDF

Submission history

[v1] 2019-07-30 06:28:12

Unique-IP document downloads: 14 times 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. 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