Timeline for Can epsilon-induction be derived from the transitive closure operator?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2016 at 11:08 | comment | added | Joel David Hamkins | Ah, sorry I had misunderstood. But the idea is similar for that case. As Emil explains in his comment, you can prove that every binary relation $R$ has a transitive closure, simply by saying $x$ is related to $y$, if there is a finite path from $x$ to $y$ through $R$. This new relation is transitive, and it is the smallest transitive relation containing $R$. | |
| May 7, 2016 at 7:37 | comment | added | L. C. | Thanks for the detailed answer. I do not however see (maybe this is obvious) how from this I get a refutation to the statement I mentioned. I was referring to the transitive closure of binary relations. | |
| May 6, 2016 at 23:45 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |