Upcoming talks

Term Modal Logic (TML) is used to model scenarios where the agent set is unbounded. For instance we can assert "There exists someone who knows it is raining" without actually knowing how many agents are present in the system. TML is closely related to  First Order Modal Logic (FOML) and in this talk we will discuss the satisfiability problem for TML. First we will see how very simple fragments of TML are already undecidable. Then we turn to an interesting fragment namely the 2 variable fragment and show that 2 variable fragment of TML (without equality) is decidable. This is interesting in two ways : 

(1) 2 variable fragment of FOML is undecidable, and hence TML is a 'decidable 2 variable subfragment of FOML'

(2) 2 variable TML is another rare extension of 2 variable first order logic that still remains decidable.

TBA