Question: What Ls wrong with the following proof ? (Non)Theorem: If binary relation R Ls symmetric and transitive, then R is reflexive. (Non)Proof: Let x be

 What Ls wrong with the following "proof ? (Non)Theorem: If binary

What Ls wrong with the following "proof ? (Non)Theorem: If binary relation R Ls symmetric and transitive, then R is reflexive. (Non)Proof: Let x be some member of the domain of R. Pick y such that xRy. By symmetry. yRx. By transitivity. xRy and yRx imply xRx. Since x is an arbitrary member of R's domain, we have shown that xRx for every element in the domain of R. which "proves" that R Ls reflexive

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!