A Proof of Stavi's Theorem
Logic in Computer Science
2023-06-22 v2
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.
Cite
@article{arxiv.1711.03876,
title = {A Proof of Stavi's Theorem},
author = {Alexander Rabinovich},
journal= {arXiv preprint arXiv:1711.03876},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:1401.2580