I If symmetric then transitive relation

  • I
  • Thread starter Thread starter rajeshmarndi
  • Start date Start date
  • Tags Tags
    Relation Symmetric
rajeshmarndi
Messages
319
Reaction score
0
Isn't, if we have xRy and yRx then xRx will also make transitive? Because if I am right {(x,x),(y,y)} on set {x,y} is symmetric and transitive.

Isn't the above similar to, if xRy and yRz then xRz is transitive relation?

Thanks.
 
Physics news on Phys.org
##R = \{(x,x),(y,y),(z,z),(x,y),(y,x),(y,z),(z,y)\}##
is an example of a relation that's symmetric and reflexive without being transitive, because
##xRy \leftrightarrow yRx##
and
##yRz \leftrightarrow zRy##
but we also have ##xRy \wedge yRz## without ##xRz##.
 
Similar but not nearly as strong. xRy and yRx => xRx is a statement about a much smaller set of x and y than the transitive property requires.
 
FactChecker said:
Similar but not nearly as strong. xRy and yRx => xRx is a statement about a much smaller set of x and y than the transitive property requires.
Does this mean transitive relation require atleast 3 distinct element of a set e.g {x,y,z}.

Also as I mentioned, is {(x,x),(y,y)} on set {x,y} reflexive along with symmetric and transitive.
 
(xRy and yRx) => xRx only makes a statement about the x & y where both xRy and yRx. There might easily be none of those, so it might say nothing.

PS. Even if the relation R is transitive, there may be no x & y where (xRy and yRx). An example is the order relation '>'. It's not possible for (x > y & y > x), even though '>' is a transitive relation.
 
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

Replies
5
Views
2K
Replies
1
Views
2K
Replies
22
Views
5K
Replies
2
Views
2K
Replies
35
Views
4K
Replies
2
Views
1K
Replies
7
Views
2K
Back
Top