The Halpern-Shoham logic is a modal logic of time intervals.

Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We complete this classification by showing -- what we believe is quite an unexpected result -- that the logic of subintervals,

the fragment of the Halpern-Shoham where only the operator "during'", or D, is allowed, is undecidable over discrete structures. This is surprising as this, apparently very simple, logic is decidable over dense orders and its reflexive variant is known to be decidable over discrete structures . Our result subsumes a lot of previous negative results for the discrete case, like the undecidability for ABE , BD , ADB, AAbarD, and so on.

The talk I am going to give will be an informal, technical, blackboard talk.

I will explain how the proof of the main result works. I will also tell something about the fun I had discovering it -- and this part is clearly not going to be too technical.

I will assume that the audience has some experience with some modal logic.