So I was given this truth table and I need to find a logical expression for the formula to give such a result (where there can be two or three 2-place connective expressions (e.g. $A \lor B$ counts as one but $\neg A$ does not count since only one variable is within it). Can anyone help me? I have been thinking for ages and I am not getting anywhere near the answer!
P Q R (Formula)
T T T F
T T F T
T F T F
T F F T
F T T T
F T F F
F F T F
F F F F
One easy solution is $$(P \land Q \land \neg R) \lor (P \land \neg Q \land \neg R) \lor (\neg P \land Q \land R)$$
The above statement is the disjunctive normal form of the searched statement. You get it by looking at all cases, where the final statement should be true. Then you concatenate each input ($A$ if the variable $A$ is true in this case and $\neg A$ if $A$ is false in this case) with $\land$. All these statements are afterwards concatenated with $\lor$.