The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the literature there are at least two main formal structures to deal with situations of interactive epistemology: Kripke models and type spaces. As shown in many papers (see Aumann and Brandenburger in Econometrica 36:1161–1180, 1995; Baltag et al. in Synthese 169:301–333, 2009; Battigalli and Bonanno in Res Econ 53(2):149–225, 1999; Battigalli and Siniscalchi in J Econ Theory 106:356–391, 2002;...
We propose a minimal logic for interactive epistemology based on a qualitative representation of epistemic individual and group attitudes including knowledge, belief, strong belief, common knowledge and common belief. We show that our logic is sufficiently expressive to provide an epistemic foundation for various game-theoretic solution concepts including “1-round of deletion of weakly dominated strategies,...
In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form $${\rm A}_{G:x} \varphi$$ reading ‘if the agents in the set of agents G identify themselves with institution x then they together accept that $${\varphi}$$ ’. We extend acceptance logic by two kinds of dynamic modal operators. The first...
We present a modal logic called $${\mathcal{LIA}}$$ (logic of intention and attempt) in which we can reason about intention dynamics and intentional action execution. By exploiting the expressive power of $${\mathcal{LIA}}$$ , we provide a formal analysis of the relation between intention and action and highlight the pivotal role of attempt in action execution. Besides, we deal with the problems...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.