Weak Vopěnka's principle does not imply Vopěnka's principle

From MaRDI portal
Publication:2295468



Abstract: Vopv{e}nka's Principle says that the category of graphs has no large discrete full subcategory, or equivalently that the category of ordinals cannot be fully embedded into it. Weak Vopv{e}nka's Principle is the dual statement, which says that the opposite category of ordinals cannot be fully embedded into the category of graphs. It was introduced in 1988 by Ad'{a}mek, Rosick'{y}, and Trnkov'{a}, who showed that it follows from Vopv{e}nka's Principle and asked whether the two statements are equivalent. We show that they are not. However, we show that Weak Vopv{e}nka's Principle is equivalent to the generalization of itself known as Semi-Weak Vopv{e}nka's Principle.












This page was built for publication: Weak Vopěnka's principle does not imply Vopěnka's principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295468)