closed by
506 views
0 votes
0 votes
closed with the note: incomplete
Show, using resolution, that the following well-formed formula is valid for all interpretations:

$\left(\forall x \forall y \left(f \left(x, y \right) \Leftarrow \neg y \left(y, x \right) = \left(\forall x \left(f \left(x, x \right)\right)$
closed by

Related questions

9 votes
9 votes
2 answers
1
makhdoom ghaya asked Nov 26, 2016
1,917 views
Show that the elements of the lattice $(N, \leq)$, where $N$ is the set of positive intergers and $a \leq b$ if and only if $a$ divides $b$, satisfy the distributive prop...
24 votes
24 votes
1 answer
4
makhdoom ghaya asked Nov 26, 2016
7,222 views
Show that grammar $G_1$ is ambiguous using parse trees:$G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$