When we symbolize a claim, we're displaying its truth-functional structure. show that you can figure out the structures of the following claims by symbolizing them. use these letters for the first ten items:

use the symbols ~, & , v, and --> . we suggest that, at least, at first, you can make symbolization a two-stage process: first replace simple parts of claims with letters; then, replace logical words with logical symbols, and add parentheses as required. we'll do an example in two stages to show you what we mean.
most signs you need to show the truth-functional relationships are on your keyboard; for 'if-then', use the > sign that is above the . on your keyboard.

example:
if parsons signs the papers, then quincy will go to jail but rachel will not file an appeal.
stage 1: if p, then q but ~r.
stage 2: p --> (q & ~r)

3. if parsons signs the papers and quincy goes to jail then rachel will file an appeal.

4. parsons signs the papers and if quincy goes to jail rachel will file an appeal.

6. if parsons signs the papers quincy goes to jail, and if rachel files an appeal quincy goes to jail.

7. quincy goes to jail if either parsons signs papers or rachel files an appeal.

8. either parsons signs the papers or, if quincy goes to jail, then rachel will file an appeal.

9. if either parsons signs the papers or quincy goes to jail then rachel will file an appeal.

10. if parsons signs the papers then either quincy will go to jail or rachel will file an appeal.

construct full truth tables or use the short truth-table method to determine which of the following arguments are valid.

for example:

l v (w -> s)
p v ~s
~l -> w
p