paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Hanf numbers via accessible images

通过可及像的 Hanf 数
LMCS vol.Volume 13, Issue 22017匹配度 1/10 · 该论文属于模型论/范畴论与可及范畴中的 Hanf 数、AEC、度量 AEC 研究,与用户关注的静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析没有直接交叉。虽然涉及逻辑与形式化基础,但并非程序分析或形式化验证工具相关研究。引用 5 inbox
Michael Lieberman, Jiri Rosicky
dblp: 2026-09-10crossref: 2026-09-10arxiv: 2026-09-10

AI 速览

一句话:在大基数假设下用可及函子的可及像,将 AEC 的 Hanf 数结果推广到可及范畴,并证明度量 AEC 强 d-tame。

本文研究抽象初等类(AEC)与可及范畴中结构性质(如 joint embedding 与 amalgamation)的 Hanf 数提升问题。作者基于如下事实:若存在 proper class of almost strongly compact cardinals,则任意 accessible functor 的 powerful image 仍是 accessible。利用这一可及性结果,作者把 Baldwin 与 Boney 最近的 Hanf 数计算从 AEC 推广到可及范畴:若这些性质对直到足够大基数的模型成立,则对所有大小的模型成立。此外,在上述大基数假设下,论文证明每个度量 AEC 都是 strongly d-tame,从而加强了 Boney 与 Zambrano 的结果,并指出进一步推广的路径。

问题
研究在可及范畴与抽象初等类(AEC)中,joint embedding、amalgamation 等结构性质能否从足够大的基数提升到任意基数,即 Hanf 数计算问题。
方法
在存在 proper class of almost strongly compact cardinals 的假设下,利用 accessible functor 的 powerful image 可及性,把 Baldwin–Boney 的 Hanf 数结果推广到可及范畴,并用范畴论与模型论证明度量 AEC 的强 d-tameness。
评估
以纯数学定理证明为评估方式;在给定大基数假设下证明新定理,并与 Baldwin–Boney、Boney–Zambrano 的已有结果比较,显示加强和推广。
原文摘要(Abstract)

We present several new model-theoretic applications of the fact that, under the assumption that there exists a proper class of almost strongly compact cardinals, the powerful image of any accessible functor is accessible. In particular, we generalize to the context of accessible categories the recent Hanf number computations of Baldwin and Boney, namely that in an abstract elementary class (AEC) if the joint embedding and amalgamation properties hold for models of size up to a sufficiently large cardinal, then they hold for models of arbitrary size. Moreover, we prove that, under the above-mentioned large cardinal assumption, every metric AEC is strongly d-tame, strengthening a result of Boney and Zambrano and pointing the way to further generalizations.Comment: v1: 15 pages. v2: 13 pages, reformatted with minor edits. v3: 15 pages, title changed from "Bootstrapping structural properties, via accessible images," proofs expanded, definitions clarified in response to referees' feedback. v4: 15 pages, dedication added. v5: 15 pages, minor corrections, in press

链接与引用

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

BibTeX
@article{LiebermanR17,
  title = {Hanf numbers via accessible images},
  author = {Michael Lieberman and Jiri Rosicky},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 13, Issue 2},
  year = {2017},
  doi = {10.23638/lmcs-13(2:11)2017}
}