 Q simply collapses into  SQML.[81]  (The reader can quickly verify that \(\textbf{N}_{Q}\) and the necessitist principle \(\Box\textbf{N},\) are equivalent in Q.) More exactly put: for any formula \(\varphi\) of \(\scrL_\Box,\) \(\varphi\) is a theorem of SQML if and only if it is a theorem of \(Q+ \textbf{N}_{Q}\) and hence if and only if \(\forall \sfx\rS\sfx \to \varphi\) is a theorem of Q. In particular, both BF and CBF fall out as entirely unproblematic theorems under the assumption of necessitism: