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.

Categories

Keywords

Reprint years

2004

DOI

10.1023/a:1008227432405

Other Versions

No versions found

Links

PhilArchive

External links

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

Through your library

My notes

Similar books and articles

A logic with relative knowledge operators.Demri Stephane - 1999 - Journal of Logic, Language and Information 8 (2).
Display calculi for logics with relative accessibility relations.Stéphane Demri & Rajeev Goré - 2000 - Journal of Logic, Language and Information 9 (2):213-236.
Reasoning about vague concepts in the theory of property systems.Philippe Balbiani - 2004 - Logique Et Analyse 47:445-460.
A probabilistic temporal epistemic logic: Decidability.Zoran Ognjanović, Angelina Ilić Stepić & Aleksandar Perović - 2024 - Logic Journal of the IGPL 32 (5):827-879.
A completeness proof for a logic with an alternative necessity operator.Stéphane Demri - 1997 - Studia Logica 58 (1):99-112.
The modal logic of stepwise removal.Johan van Benthem, Krzysztof Mierzewski & Francesca Zaffora Blando - 2022 - Review of Symbolic Logic 15 (1):36-63.
A New Look at the Modal Logic of Stepwise Removal.Johan van Benthem & Fenrong Liu - 2026 - In Johan van Benthem & Fenrong Liu, Graph Games and Logic Design: Recent Developments and Further Directions. Cham: Springer Nature Switzerland. pp. 385-418.
Logic For Reasoning About Knowledge.Ewa Orlowska - 1987 - Bulletin of the Section of Logic 16 (1):26-36.
A reduction-based cut-free Gentzen calculus for dynamic epistemic logic1.Martin Wirsing & Alexander Knapp - 2023 - Logic Journal of the IGPL 31 (6):1047-1068.
Knowable' as 'known after an announcement.Philippe Balbiani, Alexandru Baltag, Hans van Ditmarsch, Andreas Herzig, Tomohiro Hoshi & Tiago de Lima - 2008 - Review of Symbolic Logic 1 (3):305-334.

Analytics

Added to PP
2009-01-28

Downloads
85 (#653,938)

6 months
14 (#829,537)

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.
Logics of Complementarity in Information Systems.Ewa Orłowska & Ivo Düntsch - 2000 - Mathematical Logic Quarterly 46 (2):267-288.

View all 6 citations / 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