### Questions about identity and functors

1. Do Bostock's problem 8.1.3, at the end of the Bostock reading on identity.

2. Show that $$Fab \models \forall x(x=a \supset Fxb)$$. (This is Sider's problem 5.1a.)

3. Do Sider's problem 5.3, on p. 111.

4. Do Sider's problem 5.4, on p. 113.

1. Do Sider's problem 5.5, on p. 117. (There's a hint on p. 270.)

2. Do Sider's problem 5.7, on p. 119.

3. What are some differences between the complex, functor-using term $$successor~of~y$$, and the description $$\mathop{\mathit{\unicode{x2129}}\mkern4mu}x(y=successor~of~x)$$? You can assume the domain of quantification is $$\mathbb{N}$$.

### Questions about multisorted logics and fancier quantifiers

1. What is a multisorted logic? Why do Gamut discuss multisorted logics and restricted quantification in the same place?

2. What are the differences between (a) our original quantifiers $$\forall$$ and $$\exists$$, (b) restricted quantifiers, and (c) generalized quantifiers?

1. What is a multivalued logic? What does $$\Gamma \models \phi$$ mean when working with a multivalued logic? What does it mean to call one or more truth-values "designated"?

2. Do Sider's problem 3.7, on p. 79. (There's a hint on p. 268.)