Timeline for Non-isomorphic hypergraphs on $\omega$
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 17, 2017 at 1:33 | comment | added | Joel David Hamkins | @WłodzimierzHolsztyński Thanks for the edit, even though you haven't said it exactly as I would have. | |
Apr 16, 2017 at 20:51 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
typo
|
Apr 16, 2017 at 20:42 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
formatting typo.
|
Apr 16, 2017 at 20:34 | comment | added | Włodzimierz Holsztyński | Thank you. Now I have your intended meaning, and by now it was not difficult to follow it. | |
Apr 16, 2017 at 20:20 | comment | added | Joel David Hamkins | No, you've misunderstood @WłodzimierzHolsztyński. My hypergraphs allow, in addition to those finite edges, any collection of infinite edges. There are $2^{\aleph_0}$ many infinite edges, and so there are $2^{2^{\aleph_0}}$ many ways to form a hypergraph using them. | |
Apr 16, 2017 at 20:07 | comment | added | Włodzimierz Holsztyński | ? -- The edges of ALL hypergraphs from the collection belotg to a countable family, namely $\ \{1\ldots n\} :n\in\mathbb N\}.\ $ Thus your collection has cardinality $2^\aleph_0,\ $ which smaller than required. Am I wrong? *** I am sure that I misinterpreted your answer. Perhaps your answer is more involved. ? | |
Apr 16, 2017 at 16:53 | vote | accept | Dominic van der Zypen | ||
Apr 16, 2017 at 11:15 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |