A Research On Temporal Public Announcement Logic

There are two important aspects in describing agents’ interaction. The first one is epistemic dynamic, it describes the information events happened in the course of agents’ interaction and how agents’ epistemic state change over relevant informational events. The other one is protocol information, it represents what informational events can take place in the course of agents’ interaction. Dynamic Epistemic Logic DEL describes episitemic dynamics by event models and product update.Epistemic Temporal Logic ETL represents protocol information by branching-time tree structure. This thesis aims to introduce the Temporal Public Announcement Logic TPAL which provided by Johan van Bentem and Tomohiro Hoshi. The system captures both epistemic dynamics and protocol information at the same time, and discuss some basic properties of TPAL and its application.The main structure of this paper is as follows.Chapter One,we will introduce the languages and semantics of DEL and ETL respectively and the different ways in describing agents’ interaction and then we will analyze their advantages and disadvantages in describing agents’ interaction.Chapter Two,we will introduce Johan van Benthem’s idea about merging DEL and ETL to generate a model which captures both epistemic dynamics and protocol information at the same time. Then,we will introduce a theorem which provides a precise comparison between DEL and ETL.Chapter Three,we will reinterpret PAL languages over the PAL-generated-ETL models and study the resulted logic,which is called Temporal Public Announcement Logic TPAL.We will analyze the relation between PAL and TPAL and introduce Johan van Benthem’s method of the completeness proof of TPAL.Chapter Four,we will introduce Tomohiro Hoshi’s analysis about the problem of logical omniscience with the application of TPAL and discuss the value of TPAL in studying relevant problems.