Open main menu
Home
Random
Log in
Settings
About MyWikiBiz
Disclaimers
MyWikiBiz
Search
Changes
← Older edit
Newer edit →
Talk:Logical graph
(view source)
Revision as of 13:30, 4 December 2008
9 bytes added
,
13:30, 4 December 2008
indent bullets
Line 19:
Line 19:
[http://mathforum.org/kb/message.jspa?messageID=6513648 Problem posted by Mike1234 on the Discrete Math List at the Math Forum].
[http://mathforum.org/kb/message.jspa?messageID=6513648 Problem posted by Mike1234 on the Discrete Math List at the Math Forum].
−
* Required to show that <math>\lnot (p \Leftrightarrow q)</math> is equivalent to <math>(\lnot q) \Leftrightarrow p.</math>
+
:
* Required to show that <math>\lnot (p \Leftrightarrow q)</math> is equivalent to <math>(\lnot q) \Leftrightarrow p.</math>
===Solution===
===Solution===
−
[http://mathforum.org/kb/plaintext.jspa?messageID=6514666 Solution posted by Jon Awbrey,
working by way of
logical graphs].
+
[http://mathforum.org/kb/plaintext.jspa?messageID=6514666 Solution posted by Jon Awbrey,
expressing the problem in
logical graphs].
In logical graphs, the required equivalence looks like this:
In logical graphs, the required equivalence looks like this:
Jon Awbrey
12,080
edits