On a separate sheet of paper (or computer software program like Word) construct a truth table for the statemen

Question

On a separate sheet of paper (or computer software program like Word) construct a truth table for the statement below, and determine if the statement is a tautology, a contradiction, or contingent:
p > [~q > (q v ~q)]

Then answer the following questions based on your and number each response so I can be sure which question you are answering:

1. How many rows do you need to complete the proof?
2. What are the truth values for the statement inside the parentheses of the statement which reads: (q v ~q)?
3. State whether the statement is a tautology, contradiction, or contingent and justify your answer.

Answer 1

The previous answerer doesn't seem to know the definition of >, so here's the correct answer:

p q | ~q | (q v ~q) | ~q > (q v ~q) | p > [~q > (q v ~q)]
T T | F | T | T | T
T F | T | T | T | T
F T | F | T | T | T
F F | T | T | T | T

Answering the questions in reverse order:

3. Tautology, since it is true for all truth values of p and q.

2. q v ~q has truth value T regardless of the value of q.

1. Not sure exactly what this is asking. If it means rows of the truth table, then we need all four to prove it is a tautology. Similarly, we'd need all of them to show it was a contradiction (if it was). If the statement was contingent, we'd only need two properly chosen rows - one with truth value T and one with truth value F.

If we're talking about an actual logical proof (not based on evaluating the truth table), it should go like this:
p > [~q > (q v ~q)]
= p > [~q > T] since x v ~x = T for all x
= p > T since x > T = T for all x
= T since x > T = T for all x.

Answer 2

Here is my little table. did it quickly, so check things

p__q_~q___qv~q__~q>(qv~q)__p>~q>(qv~q)
T__T__F____T______F_________ F
T__F__T____T______T_________ T
F__T__F____T______F_________ F
F__F__T____T______T_________ F