Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
