 A set \(\Sigma\) of formulas of \(\scrL\) is said to be satisfiable if there is an interpretation for \(\scrL\) in which every member of \(\Sigma\) is true. A formula \(\varphi\) is valid, or a logical truth—written \(\vDash\varphi\)—if it is true in every interpretation for \(\scrL\).