You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

5 lines
212 B

This sequent is not provable.
$\mathcal{M} : p = T, q = T, r = T, s = F$ \\
$\mathcal{M} \models \neg (p \land q) \lor \neg (r \land s)$ \\
$\mathcal{M} \nmodels (\neg p \land \neg r) \lor (\neg q \land \neg s)$