Refinement Quantified Logics of Knowledge | Zendy

James Hales | Zendy; Tim French | Zendy; Rowan Davies | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Refinement Quantified Logics of Knowledge

Author(s) -

James Hales,

Tim French,

Rowan Davies

Publication year - 2011

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2011.10.008

Subject(s) - accessibility relation , doxastic logic , epistemic modal logic , modal logic , normal modal logic , modal , computer science , interpretation (philosophy) , possible world , multimodal logic , relation (database) , theoretical computer science , binary relation , algorithm , description logic , mathematics , discrete mathematics , programming language , epistemology , data mining , philosophy , chemistry , polymer chemistry

Refinement 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research