We add epistemic modal operators to the language of here-and-there logic and define epistemic hereand-there models. We then successively define epistemic equilibrium models and autoepistemic equilibrium models. The former are obtained from here-and-there models by the standard minimisation of truth of Pearce’s equilibrium logic; they provide an epistemic extension of that logic. The latter are ...

The present study is an attempt to problematize the multivalent data in the cyberspace through the lenses of Wittgenstein’s analytic philosophy of language. Adopting this linguistic philosophy approach is aimed at exploring the dichotomous question of whether cyberspace is a possibility for social power or it is a contributory cause of communicative discontinuity and henceforth a possibility fo...

In the game theoretic environment, there is a clear tension between the strength of a solution concept and its robustness to misspecification. In other words, if the analyst wants his model to be resilient to small errors in the parameters, then he must weaken the predictive power of the model. In fact, this tension can be made formal; under a richness assumption (loosely speaking, for every st...

An account of meta-epistemic defeaters—distinct from traditional (firstorder) epistemic defeaters—is motivated and defended, drawing from case studies involving epistemic error-theory (e.g., Olson 2011, Reasons for belief; cf., Streumer 2012, J Philos 110:1–25) and epistemic relativism (e.g., MacFarlane 2005, Oxford Stud Epistemol 1:197–233; 2011; 2014, Assessment sensitivity: Relative truth an...

We describe the planning problem within the framework of dynamic epistemic logic (DEL), considering the tree of sequences of events as the underlying structure. In general, the DEL planning problem is computationally difficult to solve. On the other hand, a great deal of fruitful technical advances have led to deep insights into the way DEL works, and these can be exploited in special cases. We...

We propose a dynamic epistemic framework for the verification of security protocols. First, we introduce a dynamic epistemic logic equipped with iteration and cryptographic supplements in which we can formalize and check (epistemic) requirements of security protocols. On top of this, we give a general guide how to go from a protocol specification to its representation in our framework. We demon...

Reasoning about actions forms the foundation of prediction, planning, explanation, and diagnosis in a dynamic environment. Most of the research in this field has focused on domains with a single agent, albeit in a dynamic environment, with considerably less attention being paid to multi-agent domains. In a domain with multiple agents, interesting issues arise when one considers the knowledge of...

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

Public announcement logic (PAL) is a paradigm case of dynamic epistemic logic, which models how agents’ epistemic states change when pieces of information are communicated publicly. PAL extends epistemic logic with the operator [A], where the intended reading of [A]φ is “After a public announcement that A, φ holds.” This logic has recently received two improvements. One improvement, studied in ...

We develop an algebraic modal logic that combines epistemic and dynamic modalities with a view to modelling information acquisition (learning) by automated agents in a changing world. Unlike most treatments of dynamic epistemic logic, we have transitions that “change the state” of the underlying system and not just the state of knowledge of the agents. The key novel feature that emerges is the ...