Set Theory and Logic


P=NP Resolution, with 3-Sat not Tautologous © Copyright 2017-2018 by Colin James III All Rights Reserved.

Authors: Colin James III

We use the definition of NP as “nondeterministic polynomial time” from Stephen Cook at It is not tautologous and is presented in a truth table on 1024-values. An example from the same source for the 3-SAT test as NP-complete for the expression (p∨q∨r)∧(~p∨q∨~r)∧(p∨~q∨s)∧(~p∨~r∨~s), with τ(P)=τ(Q)=Tautologous and τ(R)=τ(S)=contradictory, is not tautologous.

Comments: 3 Pages. © Copyright 2017-2018 by Colin James III All rights reserved.

Download: PDF

Submission history

[v1] 2018-02-25 07:56:34

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