Flag 0 users think it is non-scientific; after 15 it will be moderated. Victor Porton A new proof that if P=NP, it’s a constructive problem (that is an algorithm that is polynomial-time NP-complete under the supposition that polynomial-time NP-complete algorithms exist). PDF…

read moreFlag 0 users think it is non-scientific; after 15 it will be moderated. Victor Porton Finite and infinite formulas are considered axiomatically. Article text. Flag 0 users think it is non-scientific; after 15 it will be moderated.

read moreFlag 0 users think it is non-scientific; after 15 it will be moderated. An earlier version of this work was published by scientific publisher INFRA-M. See also: Why Algebraic Theory of General Topology is Super-Important. Introduced several new axiomatic systems not less…

read more