Sturm, H. and Wolter, F. and Zakharyaschev, Michael (2000) Monodic epistemic predicate logic. In: Ojeda-Aciego, M. and de Guzman, I.P. and Brewka, G. and Moniz Pereira, L. (eds.) JELIA 2000: Logics in Artificial Intelligence, European Workshop. Lecture Notes in Computer Science 1919. Springer, pp. 329-344. ISBN 9783540411314.
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 08 Nov 2021 16:39 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46641 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
