Propositional Epistemic Logics with Quantification Over Agents of Knowledge (An Alternative Approach)

Studia Logica 107 (4):753-780 (2019)

Authors
Abstract
In the previous paper with a similar title :311–344, 2018), we presented a family of propositional epistemic logics whose languages are extended by two ingredients: by quantification over modal operators or over agents of knowledge and by predicate symbols that take modal operators as arguments. We denoted this family by \}\). The family \}\) is defined on the basis of a decidable higher-order generalization of the loosely guarded fragment of first-order logic. And since HO-LGF is decidable, we obtain the decidability of logics of \}\). In this paper we construct an alternative family of decidable propositional epistemic logics whose languages include ingredients and. Denote this family by \}\). Now we will use another decidable fragment of first-order logic: the two variable fragment of first-order logic with two equivalence relations +2E) [the decidability of FO\+2E was proved in Kieroński and Otto :729–765, 2012)]. The families \}\) and \}\) differ in the expressive power. In particular, we exhibit classes of epistemic sentences considered in works on first-order modal logic demonstrating this difference.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
ISBN(s)
DOI 10.1007/s11225-018-9824-6
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,327
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.
Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2002 - Bulletin of Symbolic Logic 8 (2):299-301.
From BDI and Stit to Bdi-Stit Logic.Caroline Semmling & Heinrich Wansing - 2008 - Logic and Logical Philosophy 17 (1-2):185-207.

View all 14 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

First Order Common Knowledge Logics.Frank Wolter - 2000 - Studia Logica 65 (2):249-271.
Term-Modal Logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
An Event-Based Fragment of First-Order Logic Over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
Deciding Regular Grammar Logics with Converse Through First-Order Logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
Free Quantified Epistemic Logics.Giovanna Corsi & Eugenio Orlandelli - 2013 - Studia Logica 101 (6):1159-1183.
Decidable and Undecidable Logics with a Binary Modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.
On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.

Analytics

Added to PP index
2018-08-22

Total views
9 ( #783,197 of 2,271,454 )

Recent downloads (6 months)
3 ( #417,328 of 2,271,454 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature