Timeline for Free monad sequence versus colimit over injections of ordered sets
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 26, 2016 at 21:23 | comment | added | Tim Campion | $m+n$ in this post should be $m \cdot n$. | |
Aug 17, 2016 at 16:51 | comment | added | Tim Campion | Those were exactly my sentiments about the question! So a big thanks to @GabrielC.Drummond-Cole for noticing this entrée into understanding what Kelly is doing! Also since writing this answer I've noticed that unlike the cosimplex category, the semisimplex category is not sifted, so the condition of preserving its colimits is really quite stringent. | |
Aug 17, 2016 at 14:06 | comment | added | David White | Great answer! Now I want to go back and try to read that Kelly paper again. | |
Aug 17, 2016 at 4:28 | vote | accept | Gabriel C. Drummond-Cole | ||
Aug 17, 2016 at 3:47 | history | answered | Tim Campion | CC BY-SA 3.0 |