Timeline for Independence of a certain set w.r.t. Z set theory with urelements
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 3, 2017 at 2:52 | vote | accept | Christopher Menzel | ||
| Feb 2, 2017 at 12:53 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
fixed grammatical fragment
|
| Feb 2, 2017 at 12:00 | comment | added | Joel David Hamkins | The issue is that you need replacement to undertake the decoding. | |
| Feb 2, 2017 at 4:37 | comment | added | Christopher Menzel | Never mind, I think I was confused about my coding idea. | |
| Feb 2, 2017 at 4:23 | comment | added | Christopher Menzel | This is great, thank you! But I'm now confused as to why my coding trick wouldn't work for A finite. Am I wrong that Z can prove the recursion theorem for functions on ω? My fuzzy recollection is that, for any inductively defined function f : ω ⟶ ω, you can prove the existence of all the finite "approximations" of f (i.e., f up to some n) in Z and then extract the set of them from ℘(ωxω) by Separation and weld them together via Union to get f. Where am I going off the rails here? | |
| Feb 2, 2017 at 3:57 | comment | added | Joel David Hamkins | Yes, it seems we posted the same construction at the same time. I had wanted to emphasize that the construction works even when $A$ is finite, which is contrary to the OPs remarks. | |
| Feb 2, 2017 at 3:14 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |