Trust Signal Map
Public graph snapshot linking moderation, structured review and trust-aware ranking.
Graph explorer
We consider the stack $\mathcal{L}og_X$ parametrizing log schemes over a log scheme $X$, and weak and strong properties of log morphisms via $\mathcal{L}og_X$, as defined by Olsson. We give a concrete combinatorial presentation of $\mathcal{L}og_X$, and prove a simple criterion of when weak and strong properties of log morphisms coincide. We then apply this result to the study of logarithmic regularity, derive its main properties, and give a chart criterion analogous to Kato's chart criterion of logarithmic smoothness.
preprint / 2022