Expressive completeness by separation for discrete time interval temporal logic with expanding modalities

Recently we established an analog of Gabbay's separation theorem about linear temporal logic (LTL) for the extension of Moszkowski's discrete time propositional Interval Temporal Logic (ITL) by two sets of expanding modalities, namely the unary neighbourhood modalities and the binary weak inverses of ITL's chop operator. One of the many useful applications of separation in LTL is the concise proof of LTL's expressive completeness wrt the monadic first-order theory of $〈\omega ,<〉$ it enables. In this paper we show how our separation theorem about ITL facilitates a similar proof of the expressive completeness of ITL with expanding modalities wrt the monadic first- and second-order theories of $〈Z,<〉$.