arnold beckmann
Deciding logics of linear Kripke frames with scattered end pieces
We show that logics based on linear Kripke frames – with or without constant domains – that have a scattered end piece are not recursively enumerable. This is done by reduction to validity in all finite classical models.