
15The Sum Relation as a Primitive Concept of MereologyStudia Logica 117. forthcoming.Mereology in its formal guise is usually couched in a language whose signature contains only one primitive binary predicate symbol representing the part of relation, either the proper or improper one. In this paper, we put forward an approach to mereology that uses mereological sum as its primitive notion, and we demonstrate that it is definitionally equivalent to the standard parthoodbased theory of mereological structures.

Losing connection: the modal logic of definable link deletionJournal of Logic and Computation 30 (3). 2020.

46Mereological Bimodal LogicsReview of Symbolic Logic 15 (4): 823858. 2022.In this paper, using a propositional modal language extended with the window modality, we capture the firstorder properties of various mereological theories. In this setting,$\Box \varphi $readsall the parts(of the current object)are$\varphi $, interpreted on the models with awholepartbinary relation under various constraints. We show that all the usual mereological theories can be captured by modal formulas in our language via frame correspondence. We also correct a mistake in the existing co…Read more

45A Modal Logic for Supervised LearningJournal of Logic, Language and Information 31 (2): 213234. 2022.Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. In this work, we develop a general framework—the supervised learning game—to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand, Learner may make mistakes in the learning process, and she may also ignore the potential relation…Read more

16On the Subtle Nature of a Simple Logic of the Hide and Seek GameIn Alexandra Silva, Renata Wassermann & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation: 27th International Workshop, Wollic 2021, Virtual Event, October 5–8, 2021, Proceedings, Springer Verlag. pp. 201218. 2021.We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of firstorder logic which behave in a similar fashion and we add a new modal variant to that class of logics. We also discuss the relative expressive power of the proposed logic in comparison to the standard modal counterparts.

27A Simple Logic of the Hide and Seek GameStudia Logica 111 (5): 821853. 2023.We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of firstorder logic which behave in a similar fashion with respect to such a language extension, and we add a new modal variant to that class. We discuss the relative expressive power of the proposed logic in comparison to the standa…Read more
Dazhu Li
Institute of Philosophy, Chinese Academy of Sciences

Institute of Philosophy, Chinese Academy of SciencesAssociate Professor

Department of Philosophy, University of Chinese Academy of SciencesAssociate Professor
Tsinghua University and University of Amsterdam
Alumnus, 2021
Areas of Specialization
Modal Logic 
Areas of Interest
Modal Logic 