Accessibility and the solution set condition
From MaRDI portal
It was observed by \textit{M. Makkai} and \textit{R. Paré} [``Accessible categories, Contemp. Math. 104 (1989; Zbl 0703.03042)] that given accessible categories \({\mathcal K}\) and \({\mathcal L}\), every accessible functor \(F : {\mathcal K} \to {\mathcal L}\) satisfies the solution-set condition. In the present paper the authors prove that, conversely, the solution-set condition guarantees that \(F\) is accessible. This result requires, in fact is equivalent to, the large cardinal Vopenka's principle.
Recommendations
Cites work
- Abschwächungen des Adjunktionsbegriffs
- Accessible Categories: The Foundations of Categorical Model Theory
- Cantors Diagonalprinzip für Kategorien
- Compact and hypercomplete categories
- scientific article; zbMATH DE number 3650785 (Why is no real title available?)
- scientific article; zbMATH DE number 3826063 (Why is no real title available?)
- scientific article; zbMATH DE number 3652325 (Why is no real title available?)
- scientific article; zbMATH DE number 3751225 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- scientific article; zbMATH DE number 3356996 (Why is no real title available?)
- Lokal präsentierbare Kategorien. (Locally presentable categories)
- Semi-topological functors. I
- Small subcategories and completeness
- The Family Approach to Total Cocompleteness and Toposes
- Total Categories and Solid Functors
- Total categories with generators
- Unexpected properties of locally presentable categories
- Yoneda structures on 2-categories
Cited in
(4)
This page was built for publication: Accessibility and the solution set condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346709)
