TY - JOUR

T1 - Arity hierarchy for temporal logics

AU - Rabinovich, Alexander

PY - 2008/8/28

Y1 - 2008/8/28

N2 - A major result concerning temporal logics is Kamp's Theorem which states that the pair of modalities "until" and "since" is expressively complete for the first-order fragment of the monadic logic over the linear-time canonical model of naturals. The paper concerns the expressive power of temporal logics over trees. The main result states that in contrast to Kamp's Theorem, for every n there is a modality of arity n definable by a monadic logic formula, which is not equivalent over trees to any temporal logic formula which uses modalities of arity less than n. Its proof takes advantage of an instance of Shelah's composition theorem.This result has interesting corollaries, for instance reproving that C T L* and E C T L+ have no finite basis.

AB - A major result concerning temporal logics is Kamp's Theorem which states that the pair of modalities "until" and "since" is expressively complete for the first-order fragment of the monadic logic over the linear-time canonical model of naturals. The paper concerns the expressive power of temporal logics over trees. The main result states that in contrast to Kamp's Theorem, for every n there is a modality of arity n definable by a monadic logic formula, which is not equivalent over trees to any temporal logic formula which uses modalities of arity less than n. Its proof takes advantage of an instance of Shelah's composition theorem.This result has interesting corollaries, for instance reproving that C T L* and E C T L+ have no finite basis.

KW - Expressive power

KW - Temporal logic

UR - http://www.scopus.com/inward/record.url?scp=48449094499&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2008.06.006

DO - 10.1016/j.tcs.2008.06.006

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:48449094499

SN - 0304-3975

VL - 403

SP - 373

EP - 381

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2-3

ER -