one of the most controversial problems in western epistemology is the division of propositions into analytic and synthetic. this division drew the attention of many proponents and opponents and faced many objections. one the most important objections which if valid enough, can destroy the basis of this division and resulting epistemological consequences is the of relativity of both analytic as ...

Any scientific discovery must include an epistemic process to gain knowledge of or to ascertain the existence of some empirical and/or logical entailments previously unknown or unrecognized. This paper proposes a new programming paradigm, named Epistemic Programming, which regards entailments as the subject of computing, takes three primary epistemic operations, i.e., epistemic deduction of kno...

A commonly used dynamic epistemic logic is one obtained by adding common knowledge and public announcements to a basic epistemic logic. It is known from Kooi (2007) that adding public substitutions to such a logic adds expressivity over the class K of models. Here I show that substitutions also add expressivity over the classes KD45, S4 and S5 of models. Since the combination of common knowledg...

This paper studies the logical features of social group creation. We focus on the mechanisms which indicate when agents can form a team based on the correspondence in their set of features (behavior, opinions, etc.). Our basic approach uses a semi-metric on the set of agents, which is used to construct a network topology. Then it is extended with epistemic features to represent the agents’ epis...

Two currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitional ability, focusing on what coalitions of agents can achieve by cooperating strategically. In this paper we make a first attempt to bridge these topics by considering the question: “what can a coalition achieve by publ...

This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol formulas that partially reveal the most recent event that occured. The completeness theorem is by filtration followed by model unravelling and other model transformations. Decidability follows from the completeness proof....

In this paper we show how to formalise false-belief tasks like the Sally-Anne task and the second-order chocolate task in Dynamic Epistemic Logic (DEL). False-belief tasks are used to test the strength of the Theory of Mind (ToM) of humans, that is, a human’s ability to attribute mental states to other agents. Having a ToM is known to be essential to human social intelligence, and hence likely ...