Name
Abstract | ||
|---|---|---|
We introduce a variant of the standard epistemic logic S5 for reasoning about knowledge under hypotheses or background assumptions. The modal operator of necessity expressing what is known is parameterised with a hypothesis. The operator can be described as relative necessity, a notion already used by Chellas to describe conditionality. In fact, the parameterised box resembles a conditional operator and it turns out that our logic is a variant of Chellas' Conditional Logic. We present an axiomatisation of the logic and show that it bears the same expressivity and computational complexity as S5. Then we consider the extension of our logic with operators for distributed knowledge and show how it can be used to represent knowledge of agents whose epistemic capacity corresponds to any system between S4 and S5. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-24130-7_21 | LORI |
Keywords | Field | DocType |
standard epistemic logic,background assumption,conditional logic,epistemic capacity corresponds,relative necessity,modal operator,conditional operator,computational complexity,parameterised box,epistemic logic,hypotheses,knowledge | Epistemic modal logic,Computational logic,Strict conditional,Autoepistemic logic,Normal modal logic,Multimodal logic,Algorithm,Theoretical computer science,Philosophy of logic,Mathematics,Dynamic logic (modal logic) | Conference |
Volume | ISSN | Citations |
6953 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Levan Uridia | 1 | 8 | 4.62 |
| Dirk Walther | 2 | 0 | 1.69 |