A logic with relative knowledge operators

Journal of Logic, Language and Information 8 (2):167-185 (1999)
  Copy   BIBTEX

Abstract

We study a knowledge logic that assumes that to each set of agents, an indiscernibility relation is associated and the agents decide the membership of objects or states up to this indiscernibility relation. Its language contains a family of relative knowledge operators. We prove the decidability of the satisfiability problem, we show its EXPTIME-completeness and as a side-effect, we define a complete Hilbert-style axiomatization.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
49 (#468,991)

6 months
7 (#469,699)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Modal Logic of Agreement and Noncontingency.Lloyd Humberstone - 2002 - Notre Dame Journal of Formal Logic 43 (2):95-127.
A study of modal logic with semantics based on rough set theory.Md Aquil Khan, Ranjan & Amal Talukdar - 2024 - Journal of Applied Non-Classical Logics 34 (2):223-247.
Display calculi for logics with relative accessibility relations.Stéphane Demri & Rajeev Goré - 2000 - Journal of Logic, Language and Information 9 (2):213-236.

Add more citations

References found in this work

Knowledge and belief.Jaakko Hintikka - 1962 - Ithaca, N.Y.,: Cornell University Press.
On Some Completeness Theorems in Modal Logic.D. Makinson - 1966 - Mathematical Logic Quarterly 12 (1):379-384.
Necessity and contingency.M. J. Cresswell - 1988 - Studia Logica 47 (2):145 - 149.

View all 11 references / Add more references