Recent content by c4nn3t

So I've got ((q→p) ^ (p→r))→(r→q) And I have to simplify it down as much as possible using only one logical connective for the end result (not one type, just one total). Here's been my workflow so far: ((¬q v p) ^ (¬p v r))→(¬r v q) ¬((¬q v p) ^ (¬p v r)) v (¬r v q) ¬(¬q v p) v ¬( ¬p v r)) v...

AH, okay, now that first part makes sense, thanks so much for that! I'm not still sure if I've grasped the second part. Also, I forgot to mention, J is the number of vertices, and E is the number of edges in the graph, I'll update the original post to reflect that. So I'd start out saying for a...

Hello all, I'm a bit stumped when it comes to formal proofs. I PART A: "Let A,B ⊆{1,2...n} be two sets with A,B > n/2. Prove that the intersection of A ∩ B is nonempty." This part I used contradiction, but didn't get everything. I assumed that if the intersection of A and B was empty, then A∪B...