Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system K_n lacks Craig Interpolation.

**Weakly Aggregative Modal Logic: Characterization and Interpolation**[preprint]

Joint with Jixin Liu and Yanjing Wang; in LORI 2019.

**When Do Introspection Axioms Matter for Multi-Agent Epistemic Reasoning?**[preprint] [slides]

Joint with Wesley Holliday and Cedegao Zhang; in TARK 2019.

The early literature on epistemic logic in philosophy focused on reasoning about the knowledge or belief of a single agent, especially on controversies about "introspection axioms" such as the 4 and 5 axioms. By contrast, the later literature on epistemic logic in computer science and game theory has focused on multi-agent epistemic reasoning, with the single-agent 4 and 5 axioms largely taken for granted. In the relevant multi-agent scenarios, it is often important to reason about what agent A believes about what agent B believes about what agent A believes; but it is rarely important to reason just about what agent A believes about what agent A believes. This raises the question of the extent to which single-agent introspection axioms actually matter for multi-agent epistemic reasoning. In this paper, we formalize and answer this question. To formalize the question, we first define a set of multi-agent formulas that we call agent-alternating formulas, including formulas like Box_a Box_b Box_a p but not formulas like Box_a Box_a p. We then prove, for the case of belief, that if one starts with multi-agent K or KD, then adding both the 4 and 5 axioms (or adding the B axiom) does not allow the derivation of any new agent-alternating formulas -- in this sense, introspection axioms do not matter. By contrast, we show that such conservativity results fail for knowledge and multi-agent KT, though they hold with respect to a smaller class of agent-nonrepeating formulas.

**On the Logics with Propositional Quantifiers Extending S5Pi**[preprint] [slides]

In Advances in Modal Logic 2018.

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary quantifiers. We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π.

**The Logic of Comparative Cardinality**[preprint] [slides]

Joint with Matthew Harrison-Trainer and Wesley Holliday; R&R for Journal of Symbolic Logic.

This paper investigates the principles that one must add to Boolean algebra to capture reasoning not only about intersection, union, and complementation of sets, but also about the relative size of sets. We completely axiomatize such reasoning under the Cantorian definition of relative size in terms of injections.

**Epistemic Logic with Functional Dependency Operator**[preprint]

Studies in Logic, Vol. 9, No. 4 (2016): 55-84.

Epistemic logic with non-standard knowledge operators, especially the "knowing-value'' operator, has recently gathered much attention. With the "knowing-value'' operator, we can express knowledge of individual variables, but not of the relations between them in general. In this paper, we propose a new operator Kf to express knowledge of the functional dependencies between variables. The semantics of this Kf operator uses a function domain which imposes a constraint on what counts as a functional dependency relation. By adjusting this function domain, different interesting logics arise, and in this paper we axiomatize three such logics in a single agent setting. Then we show how these three logics can be unified by allowing the function domain to vary relative to different agents and possible worlds. A multiagent axiomatization is given in this case.

**The axiomatization and complexity of Knowing-What-Logic on model class K**[preprint]

Unpublished note.

Standard epistemic logic studies propositional knowledge, yet many other types of knowledge such as "knowing whether'', "knowing what'', "knowing how'' are frequently and widely used. This paper presents a axiomatization and a tableau for the modal logic of "knowing-what" operator on arbitrary Kripke models. As we are not working on S5 model class, this operator is not technically a "knowing" operator, but the inner structure is clearer in this setting.