| Popis: |
Vopě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 Vopě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 Adamek, Rosický, and Trnkova, who showed that it follows from Vopěnka's Principle and asked whether the two statements are equivalent. We show that they are not. However, we show that Weak Vopěnka's Principle is equivalent to the generalization of itself known as Semi-Weak Vopěnka's Principle, introduced by Adamek and Rosický in 1993. |
Full Text from ScienceDirect