You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
I have stumbled onto the following property of posets and I don't know its name or whether it has a name.
Definition:
A complete poset has property if for every subset , there exists a subset of cardinality at most satisfying .
Examples:
This property may be interesting or not (my use case is not particularly exciting), but I am asking here because of the second part of my question. I am in the process of learning more categorical logic/algebra so I tried to generalize this property to categories as an expert in algebraic categories would do and I wanted to confirm my guess.
A category has property if for any filtered diagram , there is a filtered subdiagram of cardinality at most satisfying .
(Maybe I should assert that is regular and say has cardinality less than .)
For a given , let be the cardinal successor of considered as a category. Then is filtered but has no cofinal subcategory of cardinality or less . So, for example, does _not_ have the property you define, for any .