
AbstractRefinement quantifiers were introduced to quantify over all refinements of a model in modal logic, where a refinement is described by a simulation relation. Given the “possible worlds” interpretation of modal logic, a refinement corresponds to an agent ruling out certain possible worlds based on new information. Recent work by van Ditmarsch, French and Pinchinat has presented an axiomatization and complexity results for refinement quantifiers in the general modal logic K. Here we extend these results to apply to the epistemic and doxastic settings for a single agent.
Epistemic Logic, Refinement Quantification, Decision Procedures, Axiomatizations, Theoretical Computer Science, Computer Science(all)
Epistemic Logic, Refinement Quantification, Decision Procedures, Axiomatizations, Theoretical Computer Science, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
