Some issues in CHs 8 and 9 as well as a few questions

[aas5bc]

[Spelling] Chapter 8, The Unary Operators of Boolean Algebra, states “the type of a function is given when it name”; it should be its [Question] Chapter 8, Xor, refers to a “dad”; is this a mistake or are we talking about some father of mathematics here? [Spelling] Chapter 8, A Ternary Binary Operator, states “sed”; should be set [Grammar] Chapter 8, The Syntax and Semantics of Simplified Boolean Expression Language, “Each constructor has a and can take optional parameters” needs an object [Code syntax] Chapter 8, The Semantics of Boolean Expressions: Recursive Evaluation, states “bAnd( (bOr (bTrue, bFalse)), (bNot bFalse))” but should read bNot(bFalse) [Code] Chapter 8, , states “case bOrEe1, e2) => bEval(e1) || bEval(e2)”; code is missing opening parenthesis before e1 and has an extra E [Question] Chapter 8, Semantics, the method bEval has “=>”; is this the match operator itself or just a syntactical part of using match? [Spelling] Chapter 9, introduction, states “readilt” instead of “readily” [Grammar] Chapter 9, introduction, states “without satisfy”; should read “without satisfying” [Grammar] Chapter 9, Semantics of Prop Logic, “defines a of what” missing a word [Spelling] ]Chapter 9, Semantics of Prop Logic, though,t has a comma in the middle of a word [Question] Chapter 9, Satisfiability, Validity, states “At the same time, we do not know that there is not a more efficient algorithm. Many experts would bet that there isn’t one, but until we know for sure, there is a tantalizing possibility that someone someday will find an efficient decision procedure for Boolean satisfiability.” How does one go about finding that more efficient algorithm and why can’t we prove that there is not one?