paperbot · PL 论文追踪

全部论文 待读 收藏

P2 On The Axioms Of $\mathcal{M},\mathcal{N}$-Adhesive Categories

论 M,N-粘合范畴的公理
LMCS vol.Volume 21, Issue 12025匹配度 2/10 · 该论文属于范畴论/形式语义基础,推广 M,N-粘合范畴与 Grothendieck topos 嵌入,主要服务图重写系统理论;与用户关注的静态分析、LLM/Agent 交叉、浮点程序分析和贝叶斯程序分析均无直接关联。引用 0 inbox
Davide Castelnovo, Marino Miculan
crossref: 2026-09-10

AI 速览

一句话:把粘合范畴的刻画与 Grothendieck topos 嵌入定理推广到 M,N-粘合范畴,并引入 N-粘合态射。

粘合与拟粘合范畴为代数图重写系统提供统一框架。本文研究近期提出的 M,N-粘合范畴,旨在推广(拟)粘合性。作者引入 N-粘合态射,将 M,N-粘合性刻画为子对象偏序集上的条件;并证明任一 M,N-粘合范畴都可经保持拉回与 M,N-推出的函子嵌入到 Grothendieck topos 中。该结果统一并扩展了已知的(拟)粘合范畴嵌入定理,为代数图重写中更精细的推出结构提供范畴论基础。

问题
如何为 M,N-粘合范畴给出公理化刻画,并将(拟)粘合范畴到 Grothendieck topos 的嵌入定理推广到该设定?
方法
引入 N-粘合态射,用子对象偏序集条件表达 M,N-粘合性,并构造保持拉回与 M,N-推出的 Grothendieck topos 嵌入。
评估
以范畴论定理证明方式验证推广;结果与已知(拟)粘合范畴结论一致并扩展之,无实验评估。
原文摘要(Abstract)

Adhesive and quasiadhesive categories provide a general framework for the study of algebraic graph rewriting systems. In a quasiadhesive category any two regular subobjects have a join which is again a regular subobject. Vice versa, if regular monos are adhesive, then the existence of a regular join for any pair of regular subobjects entails quasiadhesivity. It is also known (quasi)adhesive categories can be embedded in a Grothendieck topos via a functor preserving pullbacks and pushouts along (regular) monomorphisms. In this paper we extend these results to $\mathcal{M}, \mathcal{N}$-adhesive categories, a concept recently introduced to generalize the notion of (quasi)adhesivity. We introduce the notion of $\mathcal{N}$-adhesive morphism, which allows us to express $\mathcal{M}, \mathcal{N}$-adhesivity as a condition on the subobjects' posets. Moreover, $\mathcal{N}$-adhesive morphisms allows us to show how an $\mathcal{M},\mathcal{N}$-adhesive category can be embedded into a Grothendieck topos, preserving pullbacks and $\mathcal{M}, \mathcal{N}$-pushouts.

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@article{CastelnovoM25,
  title = {On The Axioms Of $\mathcal{M},\mathcal{N}$-Adhesive Categories},
  author = {Davide Castelnovo and Marino Miculan},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 21, Issue 1},
  year = {2025},
  doi = {10.46298/lmcs-21(1:22)2025}
}