Skip to main content
14 events
when toggle format what by license comment
Jul 4, 2017 at 8:07 answer added Mikhail Katz timeline score: 1
Jun 30, 2016 at 23:09 comment added François G. Dorais Well, I'm not sure. Kanovei and Shelah seem to iterate their construction $\omega_1$ times to get countable saturation, I am neither sure you want this nor am I sure a wellordering for $\mathcal{P}(\mathbb{N})$ is sufficient.
Jun 30, 2016 at 14:20 history edited Mikhail Katz CC BY-SA 3.0
added 1 character in body
Jun 30, 2016 at 14:12 history edited Mikhail Katz CC BY-SA 3.0
added 734 characters in body
Jun 30, 2016 at 14:04 history edited Mikhail Katz CC BY-SA 3.0
added 11 characters in body
Jun 30, 2016 at 14:03 answer added Noah Schweber timeline score: 3
Jun 30, 2016 at 13:27 history edited Mikhail Katz CC BY-SA 3.0
added 37 characters in body
Jun 30, 2016 at 12:19 comment added Mikhail Katz @FrançoisG.Dorais, I agree with the first part of your comment but reserve judgment as to the second before I believe that the well-ordering is really sufficient to prove transfer. Can you give a source for this in the literature?
Jun 30, 2016 at 11:48 comment added François G. Dorais The answer to your question is in the last sentences, once you realize that "the existence of a least ordinal mapping surjectively to $\mathcal{P}(\mathbb{N})$" is equivalent to the existence of a wellordering of $\mathcal{P}(\mathbb{N})$. ACC is a red herring.
Jun 30, 2016 at 8:46 history edited Mikhail Katz
edited tags
Jun 30, 2016 at 8:28 history edited Mikhail Katz
edited tags
Jun 29, 2016 at 16:23 comment added Mikhail Katz @AndreasBlass could you possibly comment on this?
Jun 29, 2016 at 15:23 history edited Mikhail Katz CC BY-SA 3.0
deleted 4 characters in body
Jun 29, 2016 at 14:36 history asked Mikhail Katz CC BY-SA 3.0