Adámek, Jiří, and Kelly, G.M.. "-completeness is seldom monadic over graphs.." Theory and Applications of Categories [electronic only] 7 (2000): 171-205. <http://eudml.org/doc/120813>.
@article{Adámek2000, author = {Adámek, Jiří, Kelly, G.M.}, journal = {Theory and Applications of Categories [electronic only]}, keywords = {category; limit; graph; monad}, language = {eng}, pages = {171-205}, publisher = {Mount Allison University, Department of Mathematics and Computer Science, Sackville}, title = {-completeness is seldom monadic over graphs.}, url = {http://eudml.org/doc/120813}, volume = {7}, year = {2000}, }
TY - JOUR AU - Adámek, Jiří AU - Kelly, G.M. TI - -completeness is seldom monadic over graphs. JO - Theory and Applications of Categories [electronic only] PY - 2000 PB - Mount Allison University, Department of Mathematics and Computer Science, Sackville VL - 7 SP - 171 EP - 205 LA - eng KW - category; limit; graph; monad UR - http://eudml.org/doc/120813 ER -
