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.
3 lines
274 B
3 lines
274 B
\item \lect Given the formula
|
|
$$P(x,y) \lor \exists y \forall x \; \big(Q(x,y)\land R(y,z) \big),$$
|
|
construct a syntax tree for $\phi$ and determine the \textit{scope} of its quantifiers and which occurrences of the variables are \textit{free} and which are \textit{bound}.
|