[Strong assumption # 1: SQL semantics can be reduced to mathematical syntax(MS) given infinite time.]
[Strong assumption # 2:
Any decision in SQL-semantics is resolved in finite non-linear time.
(Example:CVS Directory Trees & SubtreeFiles stored in SQL-Syntax)]
[Weak assumption # 3.1:MySQL can be reduced to MS in finite time.]
[Weak assumption # 3.2:MySQL can`t be reduced to MS in finite time.]
[Strong assumption # 3.3: A third stronger algorithm exists and resolves combinatorial time explosions.
Derivation: This third stronger algorithm can be subordinated under the strongest algorithm.
Proof:RAA.
Conclusion:Strong assumption # 2 is true.