Philosophy of basic set theory proofs involving or .

scorpion990
Messages
86
Reaction score
0
Philosophy of basic set theory proofs involving "or".

Hey!

I'm working through an Introduction to Analysis text, and I'm currently on the first chapter, which covers set theory. In one of the end-of-chapter problems, I'm asked to prove a basic theorem which leads to the following statement: x is an element of A, and (x is an element of B or x is an element of C).

My text (Maxwell Rosenlicht's Introduction to Analysis) lacks in the "example" department, and so for a little while, I wasn't sure how to handle this statement. I've been pondering this for a few days, and realized that "a or b" is true if:
1. a is true. b is false.
2. b is true. a is false.
3. both a and b are true.
So, I realized that the only thing I could do was split the argument into these three possibilities. I then showed that for my particular proof, all three possibilities lead to the same statement.

I have a quick question: Is it common practice in set theory to split "or" statements into the three possible statements which can make it true, and proceed in this way? It makes a lot of sense intuitively, but I've never seen it done in any professional papers. Is there any other way to handle such statements? Thanks.
 
Physics news on Phys.org


One other way would be to break it into two cases:

a is true, b is unknown
a is false, b is true
 


Hmm... Yes. I noticed that the case in which both a and b are true is a repeat of another proof.

So is this an "acceptable" practice in analysis?
 


scorpion990 said:
Hey!

I'm working through an Introduction to Analysis text, and I'm currently on the first chapter, which covers set theory. In one of the end-of-chapter problems, I'm asked to prove a basic theorem which leads to the following statement: x is an element of A, and (x is an element of B or x is an element of C).

My text (Maxwell Rosenlicht's Introduction to Analysis) lacks in the "example" department, and so for a little while, I wasn't sure how to handle this statement. I've been pondering this for a few days, and realized that "a or b" is true if:
1. a is true. b is false.
2. b is true. a is false.
3. both a and b are true.
So, I realized that the only thing I could do was split the argument into these three possibilities. I then showed that for my particular proof, all three possibilities lead to the same statement.

I have a quick question: Is it common practice in set theory to split "or" statements into the three possible statements which can make it true, and proceed in this way? It makes a lot of sense intuitively, but I've never seen it done in any professional papers. Is there any other way to handle such statements? Thanks.

in a mathematical proof we use logical identities called laws of logic which are always true whether your a's or b's are true or false.

So the use of true or false have no significance at all.

try to prove a theorem by using tables of true or false values,i mean a long theorem not a short one it will get you into trouble.
lets say you want to prove AU(B&C)=(AUB)&(AUC) by using your approach
furthermore mathematicians use the true false approach ,because it is too difficult for them to
grasp very simple but powerfully proofs.
For example in proving that the empty set is a set of every other set in staring the proof they have to assume , xεΦ and from that to prove xεA,where A is any set . Is very difficult for them while for a logician is an easy thing.
And what do they do?They use the F----->T trick.
Because the proof is short one and it Will not get them into trouble had they had to curry on like
in a long proof
 


I'm afraid I don't quite understand the last post =(
 


scorpion990 said:
I have a quick question: Is it common practice in set theory to split "or" statements into the three possible statements which can make it true, and proceed in this way? It makes a lot of sense intuitively, but I've never seen it done in any professional papers. Is there any other way to handle such statements? Thanks.

Try to do it in proving ...AU(B&C)=(AUB)&(AUC)
 
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.
Back
Top