Set Theory and Logic


Refutation of Ramsey’s Theorem Via Pythagorean Triple of Integers

Authors: Colin James III

We evaluate the lemma proffered to prove Ramsey’s theorem, and the strengthened lemma in a note. Neither are tautologous. We evaluate the proof of Pythagorean triple of integers as colored. It also is not tautologous. In fact, the coloring or non-coloring produces a logically equivalent result, meaning the Ramsey theorem is neither a tautology nor a contradiction. This implies “the inductive hypothesis” is suspicious. What follows is that the HOL proof assistant for the Ramsey theorem is an historical enormity in its 200 TB computer program with a certified prize result. Therefore the Ramsey theorem and HOL proof assistants are non tautologous fragments of the universal logic VŁ4.

Comments: 3 Pages. © Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at (We warn troll Mikko at Disqus to read the article four times before hormonal typing.)

Download: PDF

Submission history

[v1] 2019-04-15 10:26:51

Unique-IP document downloads: 13 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