Timeline for Why the choice of pairing function in Subsystems of Second Order Arithmetic?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 8, 2012 at 22:32 | comment | added | Colin McLarty | Ah, and if I am not missing something, a key point is that the proof $\frac{n^2+n}{2}$ exists uses only bounded quantification. So there cannot be an issue of quantifier complexity. | |
| Dec 8, 2012 at 18:45 | comment | added | Nik Weaver | Well, the Cantor pairing function involves the fraction $1/2$. It wouldn't be hard to implement it in SOA, but you can't just write down the formula like we can for Simpson's pairing. So I'm going to go with "expository advantages". | |
| Dec 8, 2012 at 16:36 | history | asked | Colin McLarty | CC BY-SA 3.0 |