Deciding logics of linear Kripke frames with scattered end pieces
- First Online:
- Cite this article as:
- Beckmann, A. & Preining, N. Soft Comput (2017) 21: 191. doi:10.1007/s00500-016-2400-y
- 42 Downloads
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.