Skip Navigation

Logic Journal of IGPL 2008 16(6):591-604; doi:10.1093/jigpal/jzn024
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Koutras, C. D.
Right arrow Articles by Peppas, P.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Vol. 16 No. 6, © The Author 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

On a Simple 3-valued Modal Language and a 3-valued Logic of ‘not-fully-justified’ Belief

Costas D. Koutras

Department of Computer Science and Technology, University of Peloponnese, end of Karaiskaki Street, 22100 Tripolis, Greece. email: ckoutras{at}uop.gr

Christos Nomikos

Department of Computer Science, University of Ioannina, 45110 Ioannina, Greece. email: cnomikos{at}cs.uoi.gr

Pavlos Peppas

Department of Business Administration, University of Patras, 26500 Patras, Greece. email: pavlos{at}upatras.gr


   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.

Received for publication 16 September 2008. Revision received 16 October 2008.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.