Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10983Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Koutras, C. D. | en |
| dc.contributor.author | Nomikos, C. | en |
| dc.contributor.author | Peppas, P. | en |
| dc.date.accessioned | 2015-11-24T17:01:49Z | - |
| dc.date.available | 2015-11-24T17:01:49Z | - |
| dc.identifier.issn | 1367-0751 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10983 | - |
| dc.rights | Default Licence | - |
| dc.title | On a Simple 3-valued Modal Language and a 3-valued Logic of 'not-fully-justified' Belief | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1093/jigpal/jzn021 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2008 | - |
| heal.abstract | In this paper, we advocate the usage of the family of Heyting-valued modal logics, introduced by M. Fitting, by presenting a simple 3-valued modal language and axiomatizing an interesting 3-valued logic of belief. We give two simple bisimulation relations for the modal language, one that respects non-falsity and one that respects the truth value. the doxastic logic axiomatized, apart from being interesting in its own right for KR applications, (i) it comes with an underlying 3-valued propositional logic which is a syntactic variant of the 'logic of here-and-there*, whose importance in KR and Logic Programming is well-known, (ii) it is endowed from its very inception with a Gentzen-style proof theory from [Fit92] and a completeness theorem from [KNP02], (iii) it can be equivalently seen as a logic describing the epistemic agreement of two interrelated agents: a K45 agent who 'dominates' an S5 agent, (iv) as we show here, its satisfiability problem is NP-complete, i.e. at the lower level one can expect for applied logics. This is the first concrete example of an epistemic logic from Fitting's framework, that has been overlooked hitherto, despite its many attractive characteristics. | en |
| heal.journalName | Logic Journal of the Igpl | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nomikos-2008-On a Simple 3-valued Modal Language and a 3-valued Logic of 'not-fully-justified' Belief.pdf | 182.95 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
