Sági, Gábor (2013) Designing Decidable Logics of Epistemology. In: Informatics 2013, 2013 Nov. 5 - Nov. 7, Spisska Nova Ves, Szlovákia..
|
Text
inf2013.pdf Download (121kB) | Preview |
Abstract
We investigate the following “epistemic” extensions of (fragments of) first order logics: if phi is a formula, then box_i phi (i in I) is also a formula, where I is a fixed finite set. The intended meaning of box_i phi is “the i-th agent (ith participant of the model) knows phi”. The main result of the paper is Theorem 1: if L is such a fragment of first order logic whose consequence relation is weakly decidable, then the consequence relation of the epistemic extension of L remains weakly decidable, as well.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| Depositing User: | Dr Gábor Sági |
| Date Deposited: | 26 Sep 2014 07:29 |
| Last Modified: | 03 Apr 2023 08:19 |
| URI: | http://real.mtak.hu/id/eprint/16982 |
Actions (login required)
 |
Edit Item |
