Rabinovich, Alexander - A Proof of Stavi's Theorem

lmcs:4346 - Logical Methods in Computer Science, March 6, 2018, Volume 14, Issue 1
A Proof of Stavi's Theorem

Authors: Rabinovich, Alexander

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.


Source : oai:arXiv.org:1711.03876
DOI : 10.23638/LMCS-14(1:20)2018
Volume: Volume 14, Issue 1
Published on: March 6, 2018
Submitted on: November 13, 2017
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 79 times.
This article's PDF has been downloaded 32 times.