Set Theory and Logic

   

Refutation of the Schaefer Theorem for the P, NP Problem (Undecided)

Authors: Colin James III

We evaluate the Schaefer theorem for the P, NP problem by two examples for Graph-SAT(Ψ ). Neither example is tautologous; while claimed to be different, they result in the same truth table values. (The injection of NP-intermediate does not describe our result.) This refutes NP-complete (and P, NP, NP-hard). We also evaluate the P, NP problem as based on P≤NP with the same result. Therefore P, NP, NP-complete, NP-hard, NP-intermediate form a non tautologous fragment of the universal logic VŁ4.

Comments: 2 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 ersatz-systems.com.

Download: PDF

Submission history

[v1] 2019-05-30 11:26:45

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