Timeline for Is every formula of LΩ equivalent to a formula of L1 modulo T1?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 14, 2016 at 2:09 | comment | added | Noah Schweber | Indeed. I just wanted to point out to the OP that nothing "special" happens at $T_\Omega$. (By the way, in my original answer I meant to say that, but I got my indexing messed up - I fixed it now.) | |
| Dec 14, 2016 at 2:05 | comment | added | Joel David Hamkins | Yes. But my main point is that they are all redundant all the way back to the original language. So the constants are not needed for any purpose---we could instead just assert the instances of comprehension. | |
| Dec 14, 2016 at 2:02 | comment | added | Noah Schweber | +1. Note for the OP that we don't have to wait until $T_\Omega$ to see this for a given sentence - each sentence at level $\alpha$ is immediately seen to be "redundant" by $T_\alpha$. | |
| Dec 14, 2016 at 2:00 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |