Timeline for Smallest ensemble of sets stable by any intersections and finite union
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25 at 18:57 | comment | added | Iosif Pinelis | @EmilJeřábek : Oops! I did not pay enough attention to the question. This is now fixed. Thank you for your comment. | |
| Apr 25 at 18:55 | history | edited | Iosif Pinelis | CC BY-SA 4.0 |
deleted 7 characters in body
|
| Apr 25 at 18:34 | comment | added | Emil Jeřábek | The question asks for finite unions, but arbitrary intersections, not just finite intersections. So the correct answer is that $T$ is the set of arbitrary intersections of finite unions of elements of $S$; you can't do that with unions of intersections. | |
| Apr 25 at 14:47 | history | edited | Iosif Pinelis | CC BY-SA 4.0 |
added 178 characters in body
|
| Apr 25 at 14:37 | history | edited | Iosif Pinelis | CC BY-SA 4.0 |
added 447 characters in body
|
| Apr 25 at 14:27 | history | answered | Iosif Pinelis | CC BY-SA 4.0 |