Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
We investigate the existence of various limits and colimits in three categories: CPI (chain-complete posets and isotone maps); CPC (chain-complete posets and chain-continuous maps); CPC* (chain-complete posets and chain-continuous maps). Among other things we show CPC to be complete and cocomplete. By way of contrast we show that LC* (complete lattices and chain-*continuous maps) is neither complete nor cocomplete. We also introduce a construction which yields the chain-completion of a poset and other "completions" as special cases. © 1977.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975