Wikipedia:Reference desk/Archives/Computing/2021 August 15
| Computing desk | ||
|---|---|---|
| < August 14 | << Jul | August | Sep >> | Current desk > |
| Welcome to the Wikipedia Computing Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
August 15
editZermelo set theory
editSomeone on mathoverflow[1] claims "you need replacement to show the set of Von Neumann ordinals greater than ω+n for all n<ω is a proper class (otherwise it is consistent that it is empty)". Is that right? ZFC without replacement is ZC: is it still true in ZC that all sets can be well-ordered? What would be the order type of the reals if there were no ordinals >= ω+ω? Aren't there plenty of everyday objects like finite trees, that have high countable order types? I had heard that Vω+ω was a model of ZC and you'd get that by iterating (ω+w times) the powerset operation on ω. But surely you end up with plenty of uncountable ordinals by doing that. So either the MO poster or me is confused. There's a high chance that it's me though, as I have never actually studied this stuff. 2602:24A:DE47:BA60:8FCB:EA4E:7FBD:4814 (talk) 09:26, 15 August 2021 (UTC)
- Moved to the Mathematics section of the Reference desk. --Lambiam 10:35, 15 August 2021 (UTC)
- Whoops, not sure how I put that here by accident. 2602:24A:DE47:BA60:8FCB:EA4E:7FBD:4814 (talk) 17:25, 15 August 2021 (UTC)