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

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

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

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

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

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

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}\).

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

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

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"?

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

What is a universally free logic? (Sider calls it an inclusive free logic.)

Do Sider's problem 5.14, on p. 132.

Do Sider's problem 5.15, also on p. 132.

Point out at least two major differences between Sider's semantics for free logic and Bostock's.