  The closure operation induced by this condition is used in defining RESULT(a,s) for the language  B.  Of course, this solution treats logically equivalent static laws differently; for instance, a theory whose only static law is [P ∧ ¬Q] →R will in general determine a very different RESULT function than one whose only static law is [P ∧ ¬R] →Q.