Monodic Epistemic Predicate Logic

Authors:
Holger Sturm;Frank Wolter;Michael Zakharyaschev
Affiliations:
-;-;-
Venue:
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Year:
2000

Citing 5
Cited 4

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Reasoning about knowledge

Reasoning about knowledge
Modal description logics: modalizing roles

Fundamenta Informaticae
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
On the model theory of knowledge

On the model theory of knowledge

A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems

Computational Logic in Multi-Agent Systems
First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
First-Order Linear-time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment

Fundamenta Informaticae - Logic, Language, Information and Computation
Interactions between knowledge and time in a first-order logic for multi-agent systems: completeness results

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the monodic formulas of common knowledge predicate logic, which allow applications of epistemic operators to formulas with at most one free variable. We provide finite axiomatizations of the monodic fragment of the most important common knowledge predicate logics (the full logics are known to be not recursively enumerable) and single out a number of their decidable fragments. On the other hand, it is proved that the addition of the equality symbol to the monodic fragment makes it not recursively enumerable.