Gabbay Separation for the Duration Calculus

Gabbay’s separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In particular it enables a concise proof of Kamp’s seminal expressive completeness theorem for LTL. In 2000, Alexander Rabinovich established an expressive completeness result for a subset of the Duration Calculus (DC), a real-time interval temporal logic. DC is based on the chop binary modality, which restricts access to subintervals of the reference time interval, and is therefore regarded as introspective . The considered subset of DC is known as the ⌈ P ⌉ -subset in the literature. Neighbourhood Logic (NL), a system closely related to DC, is based on the neighbourhood modalities, also written ⟨ A ⟩ and ⟨ ¯ A ⟩ in the notation stemming from Allen’s system of interval relations. These modalities are expanding as they allow writing future and past formulas to impose conditions outside the reference interval. This setting makes temporal separation relevant: is expressive power ultimately affected, if past constructs are not allowed in the scope of future ones, or vice versa? In this paper we establish an analogue of Gabbay’s separation theorem for the ⌈ P ⌉ -subset of the extension of DC by the neighbourhood modalities, and the ⌈ P ⌉ -subset of the extension of DC by the neighbourhood modalities and chop -based analogue of Kleene star . We show that the result applies if the weak chop inverses , a pair binary expanding modalities, are given the role of the neighbourhood modalities, by virtue of the inter-expressibility between them and the neighbourhood modalities in the presence of chop .