Journal article 1051 views 186 downloads
Deciding logics of linear Kripke frames with scattered end pieces
Arnold Beckmann 
,
Norbert Preining
,
Norbert Preining
Soft Computing, Volume: 21, Issue: 1, Pages: 191 - 197
Swansea University Author:
Arnold Beckmann
DOI (Published version): 10.1007/s00500-016-2400-y
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.
| Published in: | Soft Computing |
|---|---|
| ISSN: | 1432-7643 1433-7479 |
| Published: |
2017
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa30489 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|---|
| College: |
Faculty of Science and Engineering |
| Issue: |
1 |
| Start Page: |
191 |
| End Page: |
197 |