paperbot · PL 论文追踪

RSS

A Proof of Stavi's Theorem

LMCS vol.Volume 14, Issue 12018
Alexander Rabinovich

尚未生成 AI 速览(可能缺少 API key 或等待下次运行补跑)。

原文摘要(Abstract)

Kamp's theorem established the expressive equivalence of the temporal logic with Until and Since and the First-Order Monadic Logic of Order (FOMLO) over the Dedekind-complete time flows. However, this temporal logic is not expressively complete for FOMLO over the rationals. Stavi introduced two additional modalities and proved that the temporal logic with Until, Since and Stavi's modalities is expressively equivalent to FOMLO over all linear orders. We present a simple proof of Stavi's theorem.Comment: arXiv admin note: text overlap with arXiv:1401.2580

链接与引用

DOI 原文 ·

BibTeX
@article{paperbot421,
  title = {A Proof of Stavi's Theorem},
  author = {Alexander Rabinovich},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 14, Issue 1},
  year = {2018},
  doi = {10.23638/lmcs-14(1:20)2018}
}