All Questions

I am teaching the proof-writing class (for the 3rd time) in the Fall and plan to buck the party line and use a different text than the default Bond and Keane. My parameters are as follows: Logic, ...

A language is a set of finite-length strings from some finite alphabet $\Sigma$. It is no loss of generality (for my purposes) to take $\Sigma=\{0,1\}$; so a language is a set of bit-strings. ...