# The Kleene-Rosser Paradox, The Liar's Paradox & A Fuzzy Logic Programming Paradox Imply SAT is (NO

@inproceedings{Kamouna2008TheKP, title={The Kleene-Rosser Paradox, The Liar's Paradox & A Fuzzy Logic Programming Paradox Imply SAT is (NO}, author={Rafee Ebrahim Kamouna}, year={2008} }

After examining the {\bf P} versus {\bf NP} problem against the Kleene-Rosser paradox of the $\lambda$-calculus [94], it was found that it represents a counter-example to NP-completeness. We prove that it contradicts the proof of Cook's theorem. A logical formalization of the liar's paradox leads to the same result. This formalization of the liar's paradox into a computable form is a 2-valued instance of a fuzzy logic programming paradox discovered in the system of [90]. Three proofs that show… CONTINUE READING

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 181 REFERENCES

On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic

- Mathematics, Computer Science
- 2002

- 121

Two Fuzzy Logic Programming Paradoxes Imply Continuum Hypothesis

- Mathematics, Computer Science
- 2008

- 2
- PDF

Adding truth-constants to logics of continuous t-norms: Axiomatization and completeness results

- Mathematics, Computer Science
- 2007

- 75
- PDF

Towards an automated deduction system for first‐order possibilistic logic programming with fuzzy constants

- Mathematics, Computer Science
- 2002

- 24

A Complete Calcultis for Possibilistic Logic Programming with Fuzzy Propositional Variables

- Computer Science, Mathematics
- 2000

- 61
- PDF

A logic programming framework for possibilistic argumentation: Formalization and logical properties

- Computer Science
- 2008

- 99
- PDF