Hello, I have a problem in my computer science class that goes as follows:
" prove the following using logical proofs (not truth tables)"
(p --> q) V (p --> r) V p is a tautology
I can get a few steps into it, then get stuck. Please help!
Hello, I have a problem in my computer science class that goes as follows:
" prove the following using logical proofs (not truth tables)"
(p --> q) V (p --> r) V p is a tautology
I can get a few steps into it, then get stuck. Please help!
$\displaystyle \begin{gathered}
\left( {p \to q} \right) \vee \left( {p \to r} \right) \vee p \hfill \\
\left( {\neg p \vee q} \right) \vee \left( {\neg p \vee r} \right) \vee p \hfill \\
\neg p \vee \left( {q \vee r} \right) \vee p \hfill \\
\left( {\neg p \vee p} \right) \vee \left( {q \vee r} \right) \hfill \\
\end{gathered} $