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.
 
 

2 lines
218 B

\item \self Given is a formula $\varphi = ( ( q \implies \neg p) \lor r) \implies (q \land (r \implies p) )$.
Determine a satisfying model $\mathcal{M}_1$ and a falsifying model $\mathcal{M}_2$ using its parse tree.