Soft Computing

, Volume 21, Issue 1, pp 191–197

Deciding logics of linear Kripke frames with scattered end pieces

Focus

DOI: 10.1007/s00500-016-2400-y

Cite this article as:
Beckmann, A. & Preining, N. Soft Comput (2017) 21: 191. doi:10.1007/s00500-016-2400-y
  • 50 Downloads

Abstract

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Swansea UniversitySwanseaUK
  2. 2.Accelia Inc.TokyoJapan
  3. 3.Japan Advanced Institute of Science and TechnologyNomiJapan

Personalised recommendations