Timeline for Sets of cardinalities of bases without choice
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 21, 2014 at 20:06 | history | edited | Noah Schweber | CC BY-SA 3.0 |
added 155 characters in body
|
| Apr 21, 2014 at 18:20 | comment | added | Gerhard Paseman | If you are able to talk about the subclass of script BS which arise from well-ordered bases, you should be able to show that subclass is closed under intersection. You might then explore what weakenings (larger subclasses) you have in which you can show things like closed under finite intersection. I recommend going through a universal algebra text and seeing which basic constructions are choiceless or require a minimum amount (e.g. Galois connections, congruence lattices). You may end up with something CS-theory people are doing. Gerhard "Giving Noah S's HS Theorem" Paseman, 2014.04.21 | |
| Apr 21, 2014 at 17:42 | answer | added | Asaf Karagila♦ | timeline score: 5 | |
| Apr 21, 2014 at 16:29 | history | asked | Noah Schweber | CC BY-SA 3.0 |