We give a level-by-level analysis of the Weak Vopěnka Principle for definable classes of relational structures ( $\mathrm {WVP}$ ), in accordance with the complexity of their definition, and we determine the large-cardinal strength of each level. Thus, in particular, we show that $\mathrm {WVP}$ for $\Sigma _2$ -definable classes is equivalent to the existence of a strong cardinal. The main theorem (Theorem 5.11) shows, more generally, that $\mathrm {WVP}$ for $\Sigma _n$ -definable classes is equivalent to the existence of a $\Sigma _n$ -strong cardinal (Definition 5.1). Hence, $\mathrm {WVP}$ is equivalent to the existence of a $\Sigma _n$ -strong cardinal for all $n<\omega $ .

We introduce a notion of complexity of diagrams (and, in particular, of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several examples of this new definition in categories of wide common interest such as finite sets, Boolean functions, topological spaces, vector spaces, semilinear and semialgebraic sets, graded algebras, affine and projective varieties and schemes, and modules over polynomial rings. We show that on one hand categorical complexity recovers in several settings classical notions of nonuniform computational complexity (such as circuit complexity), while on the other hand it has features that make it mathematically more natural. We also postulate that studying functor complexity is the categorical analog of classical questions in complexity theory about separating different complexity classes.

A fundamental idea in toric topology is that classes of manifolds with well-behaved torus actions (simply, toric spaces) are classified by pairs of simplicial complexes and (non-singular) characteristic maps. In a previous paper, the authors provided a new way to find all characteristic maps on a simplicial complex $K(J)$ obtainable by a sequence of wedgings from $K$.The main idea was that characteristic maps on $K$ theoretically determine all possible characteristic maps on a wedge of $K$.

We further develop our previous work for classification of toric spaces. For a star-shaped simplicial sphere $K$ of dimension $n-1$ with $m$ vertices, the Picard number Pic$(K)$ of $K$ is $m-n$. We call $K$ a seed if $K$ cannot be obtained by wedgings. First, we show that for a fixed positive integer $\ell $, there are at most finitely many seeds of Picard number $\ell $ supporting characteristic maps. As a corollary, the conjecture proposed by V. V. Batyrev in is solved affirmatively.

Secondly, we investigate a systematicmethod to find all characteristic maps on $K(J)$ using combinatorial objects called (realizable) puzzles that only depend on a seed $K$. These two facts lead to a practical way to classify the toric spaces of fixed Picard number.

Call a category "sketchable" if it is the category of models in sets of some sketch. This paper explores the subtle boundary between sketchable and non-sketchable categories. We show that the category of small categories that have at least one initial object and functors that take an initial object to an initial object is sketchable. The same is true for weak initial objects, but is false for subinitial objects (that every object has at most one arrow to). Analogous results hold if we substitute finite limits for terminal object. We also show that the category of groups and center-preserving homomorphisms is not sketchable. We describe briefly how "higher-order" sketches can fill these gaps.