paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Disjunctive bases: normal forms and model theory for modal logics

析取基:模态逻辑的范式与模型论
LMCS vol.Volume 15, Issue 12022匹配度 2/10 · 论文研究余代数模态逻辑的析取基与模型论结果,属于纯逻辑理论,与用户核心关注的方向(LLM/Agent 与静态分析/形式化验证的交叉、浮点程序分析、贝叶斯程序分析)没有直接关联,且缺乏工程实现或工业落地案例。引用 2 inbox
Sebastian Enqvist, Yde Venema
crossref: 2026-09-10

AI 速览

一句话:系统研究余代数模态逻辑中的析取基概念,建立模拟定理、Lyndon 定理与一致插值等范式与模型论结果。

析取基此前用于余代数 mu-演算的通用完全性证明,本文将其作为余代数模态逻辑范式的通用框架独立研究。作者证明,一步层面存在析取基会带来良好性质,尤其得到模拟定理:交替自动机可转化为等价非确定自动机。据此建立完整不动点逻辑、无不动点片段与一步片段的 Lyndon 定理,并给出完整 mu-演算及其无不动点片段的一致插值。文章还讨论析取基的存在性及其与 Moss 的 nabla 模态的关系,指出 nabla 公式为许多逻辑提供析取基,但分级模态逻辑等情形下析取基仍能给出有用范式;并证明析取基在逻辑的和、积与复合下保持,给出范畴论表述的部分解。

问题
析取基此前仅在余代数 mu-演算通用完全性证明中发挥作用,本文研究其自身作为模态逻辑范式框架的性质与适用范围。
方法
在余代数语义的一步层面考察析取基,利用模拟定理、Lyndon 定理与一致插值等证明,并比较其与 Moss nabla 模态,分析在逻辑运算下的保持性与范畴论刻画。
评估
评估为数学证明与概念分析:给出模拟、Lyndon、一致插值等定理,实例涵盖分级模态逻辑,并证明析取基对和、积、复合封闭;范畴论表述给出部分解。
原文摘要(Abstract)

We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it more thoroughly in its own right. We show that the presence of a disjunctive basis at the "one-step" level entails a number of good properties for a coalgebraic mu-calculus, in particular, a simulation theorem showing that every alternating automaton can be transformed into an equivalent nondeterministic one. Based on this, we prove a Lyndon theorem for the full fixpoint logic, its fixpoint-free fragment and its one-step fragment, and a Uniform Interpolation result, for both the full mu-calculus and its fixpoint-free fragment. We also raise the questions, when a disjunctive basis exists, and how disjunctive bases are related to Moss' coalgebraic "nabla" modalities. Nabla formulas provide disjunctive bases for many coalgebraic modal logics, but there are cases where disjunctive bases give useful normal forms even when nabla formulas fail to do so, our prime example being graded modal logic. We also show that disjunctive bases are preserved by forming sums, products and compositions of coalgebraic modal logics, providing tools for modular construction of modal logics admitting disjunctive bases. Finally, we consider the problem of giving a category-theoretic formulation of disjunctive bases, and provide a partial solution.Comment: This is a corrected version of the paper arXiv:1710.10706 published originally on 26/3, 2019

链接与引用

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

BibTeX
@article{paperbot1661,
  title = {Disjunctive bases: normal forms and model theory for modal logics},
  author = {Sebastian Enqvist and Yde Venema},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 15, Issue 1},
  year = {2022},
  doi = {10.23638/lmcs-15(1:30)2019}
}