Help with symbolic logic. Simplify ~[~(p∧q)→~q]∨q Where: ~ means negation ∧ means conjuction ∨ means disjuction → is the condicional. Seems easy , but i'm missing some rule
\neg is typically used to denote the logical negation operation on atomic formula
What is your definition of 'simplify'? In what form do you want that expression?
I have this formula: p→q = ~p∨q. So simplify is find a shortest equivalent expression
Why don't you create a truth table
I did it, and was useless. The answer is supposed to be "q", but i dont know how to reach that
~P -->~Q implied that Q--> P so, the inner of the first term turns to q-->(p and q)
I need latex for easy step up, please, post some code for imply (-->) and (^) or (v) . then I can copy that code
\ [p \rightarrow q\] (-->) \[p \rightarrow q\] \ [p\neg q\] \[p\neg q\] I cant find the ^
\[ q\wedge p\]
ok, so in the inner stuff, you have \[q\rightarrow (p\wedge q)\]
consider the (p and q ) as a wholething, you have formula for \[q\rightarrow something= \neg q\vee something\]
that means you have the inner turns to \[\neg q \vee (p \wedge q)\]
before it, you have negative, now open it, you get \[q\wedge \neg (p\wedge q)\] got it?
after them you still have \[\vee q\]so, the whole turns to \[q\wedge \neg (p\wedge q)\vee q\]
I Got it, thanks.
Join our real-time social learning platform and learn together with your friends!