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.
4 lines
196 B
4 lines
196 B
This sequent is not provable, counter example: \\
|
|
$\mathcal{M} : p = F, q = T$ \\
|
|
$\mathcal{M} \models p \implies q$ \\
|
|
$\mathcal{M} \nmodels ((p \lor q) \implies p) \land (p \implies (p \lor q))$
|