What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction

This paper introduces the Dynamic Syntactic Invariance Principle to demonstrate that a specific hidden assumption, when treated as a variable and removed, reveals a recurring structural distinction across diverse domains—including cryptography, physics, and computability—that ultimately yields a contradiction in SAT theory, thereby forcing the conclusion that $\mathsf{P}\neq\mathsf{NP}$.

Original authors: Fabio F. G. Buono