We must know -- We shall know
Logic
2020-04-21 v1
Abstract
In this article, I focus on the resiliency of the P=?NP problem. The main point to deal with is the change of the underlying logic from first to second-order logic. In this manner, after developing the initial steps of this change, I can hint that the solution goes in the direction of the coincidence of both classes, i.e., P=NP.
Cite
@article{arxiv.2004.09235,
title = {We must know -- We shall know},
author = {Jacob Zimbarg Sobrinho},
journal= {arXiv preprint arXiv:2004.09235},
year = {2020}
}