TY - JOUR
T1 - A proof of Stavi’s theorem
AU - Rabinovich, Alexander
N1 - Publisher Copyright:
© Alexander Rabinovich.
PY - 2018/3/6
Y1 - 2018/3/6
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85055803142&partnerID=8YFLogxK
U2 - 10.23638/LMCS-14(1:20)2018
DO - 10.23638/LMCS-14(1:20)2018
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85055803142
SN - 1860-5974
VL - 14
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
IS - 1
M1 - 20
ER -