Skip Navigation

Logic Journal of IGPL 2008 16(6):591-604; doi:10.1093/jigpal/jzn024
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
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

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.

References

    [BdRV01]  Blackburn P, de Rijke M, Venema Y. Modal Logic. Number 53 in Cambridge Tracts in Theoretical Computer Science. (2001) Cambridge University Press.

    [CZ97]  Chagrov A, Zakharyashev M. Modal Logic, volume 35 of Oxford Logic Guides. (1997) Oxford University Press.

    [DP90]  Davey BA, Priestley HA. Introduction to Lattices and Order. (1990) Cambridge University Press.

    [EK05]  Eleftheriou P, Koutras CD. Frame constructions, truth invariance and validity preservation in many-valued modal logic. Journal of Applied Non- Classical Logics (2005) 15(4):367–388.[CrossRef]

    [EKN08]  Eleftheriou PE, Koutras CD, Nomikos Ch. Notions of bisimulation for Heyting-valued modal languages. In: Logic and Theory of Algorithms, Proceedings of Computability in Europe 2008 (CiE 2008)—Beckman A, Dimitracopoulos C, Löewe B, eds. (2008) Athens University Press. 117–126.

    [Fit91]  Fitting MC. Many-valued modal logics. Fundamenta Informaticae (1991) 15:235–254.

    [Fit92]  Fitting MC. Many-valued modal logics II. Fundamenta Informaticae (1992) 17:55–73.

    [Fit95]  Fitting MC. Tableaus for many-valued modal logic. Studia Logica (1995) 55:63–87.[CrossRef]

    [Fit08a]  Fitting M. How True It Is = Who Says It's True. In: Talk at the 2008 International Workshop on Truth Values (2008) Dresden University of Technology.

    [Fit08b]  Fitting M. How True It Is = Who Says I's True. In: Draft (2008).

    [Gol92]  Goldblatt R. Logics of Time and Computation. Number 7 in CSLI Lecture Notes (1992) 2nd edition. Center for the Study of Language and Information, Stanford University.

    [Gol03]  Goldblatt R. Mathematical modal logic: a view of its evolution. Journal of Applied Logic (2003) 1(5–6):309–392.[CrossRef]

    [HM92]  Halpern JY, Moses Y. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence (1992) 54(2):319–379.[CrossRef][Web of Science]

    [KNP02]  Koutras CD, Nomikos Ch, Peppas P. Canonicity and completeness results for many-valued modal logics. Journal of Applied Non-Classical Logics (2002) 12(1):7–41.[CrossRef]

    [Kou03]  Koutras CD. A catalog of weak many-valued modal axioms and their corresponding frame classes. Journal of Applied Non-Classical Logics (2003) 13(1):47–72.[CrossRef]

    [Pea99]  Pearce D. Stable inference as intuitionistic validity. Journal of Logic Programming (1999) 38:79–91.[CrossRef][Web of Science]

    [RS70]  Rasiowa H, Sikorski R. The Mathematics of Metamathematics. (1970) third edition. Warsaw: PWN -Polish Scientific Publishers.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
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?