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.
Your email address will not be published. Required fields are marked *
Save my name, email, and website in this browser for the next time I comment.