Completeness of cocompletions (Q1770534): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4293501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of presheaf type / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric topos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular and exact completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5631282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits in free coproduct completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3156481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When do completion processes give rise to extensive categories? / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order categorical logic. Model-theoretical methods in the theory of topoi and related categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704208 / rank
 
Normal rank

Latest revision as of 19:19, 7 June 2024

scientific article
Language Label Description Also known as
English
Completeness of cocompletions
scientific article

    Statements

    Completeness of cocompletions (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2005
    0 references
    We know well that the existence of (finite) limits in a free cocompletion of a category \(\mathcal C\) under (finite) colimits is not automatically guaranteed. The existence of such limits is a kind of a weak completeness condition on the category \(\mathcal C\). The authors propose several weak completeness concepts. Then they show that all these concepts are equivalent in the sense that if the cone functors of all finite diagrams in a category satisfy simultaneously one of the proposed finiteness conditions, then they simultaneously satisfy any of them. The established equivalence of limit concepts is used so as to derive results on the existence of limits in colimit cocompletions. It turns out that there is a crucial difference according as we consider finite diagrams or \(\alpha\)-small ones for uncountable \(\alpha\).
    0 references
    cocompletion
    0 references
    limit
    0 references
    weak completeness condition
    0 references
    category
    0 references

    Identifiers