P is not equal to NP [article]

Sten-Ake Tarnlund
2009 arXiv   pre-print
SAT is not in P, is true and provable in a simply consistent extension B' of a first order theory B of computing, with a single finite axiom characterizing a universal Turing machine. Therefore, P is not equal to NP, is true and provable in a simply consistent extension B" of B.
arXiv:0810.5056v2 fatcat:dk7kdfcwlvg7bi5sm4chpwdtiu