Question on testing logical truths for set operations

schlynn
Messages
88
Reaction score
0
My question is on how to answer if two statements are equal in set theory. Like De'Morgans laws for example. I'm currently reading James Munkres' book "Topology" and am working through the set theory chapters now, and this isn't the first time I've seen the material, but every time I see this type of work they always use vein-diagrams to "prove" if two statements are the same. I personally don't like vein-diagrams, they don't feel rigourus enough I suppose, so my question is there another way to work on these problems? Like a more algebraic way I suppose, not drawing circles and checking overlapping sections, just isn't the type of math I enjoy.
 
Physics news on Phys.org
schlynn said:
My question is on how to answer if two statements are equal in set theory.

Two "expressions" might be "equal" or "not equal" but , technically, "statements" are "equivalent" or "not equivalent".

If you want to prove that two expressions P and Q describe the same set, prove that the statement "x is a member of P " is equivalent to "x is a member of Q". For example, proving DeMorgans laws for sets can be done by using DeMorgans laws for propositions. ( such as "not (x is an elment of A or x is an element of B)" is equivalent to "x is not an element of A and x is not an element of B".
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top