Computer Science Consider each of the following four sentences and say whether they would typically be used to make a statement or not to make a statement: Where is it? There it is! Watch out! It's coming toward us too fast!

2. For the following wffs, indicate which variables are free and which are bound (you can use 'F' for free and 'B' for bound.) Either (i) draw a vertical line underneath each variable with the letters 'F' or 'B' at the bottom of each vertical line or (ii) color the bound variables red and the free variables green. Make sure you know which symbols are variables. Not every symbol in the language of predicate logic is a variable. The reading (Scope, binding, and quantifier expansions) lists the symbols that are variables and the symbols that are names of objects (i.e., individual constants). Names of objects are not variables. You can also write the wffs on a piece of paper and submit a photo of it. (a) (Ex) (y) (z) ((Ayz --> Bzzy) v (Fxac --> Hzzu)) (b) (х) (у) Нууу --> (2) (Fzy v Hxх) (c) (Ez) (x) (у) (Ахyzbbw v Bxуcdvz)

For the following statement, write down a logically equivalent statement which containsno operators other than ¬ and ∨:? ∧ (? → ?)

what inference can you draw from the given statement and set up the statement as a proposition? A) The dog has a shiny coat or loves to bark. The dog does not have a shiny coat. B) Paul is a good swimmer or Paul is a good swimmer and runner.