For directions to the workshop venue NAB - I,
please visit the ICLA 2025 local information website.

About

While propositional modal logics have found extensive applications in reasoning about finite state systems, several applications involving unbounded data and unbounded number of processes require quantified modal logics. However, FOML has many complications: for instance, the semantics depends on whether a constant term gets the same interpretation across possible worlds, or whether it can vary. Even simple fragments of First Order Modal Logics (FOML) tend to be undecidable, and the proof theory of FOML is difficult. 

Despite such discouragement, in recent years, researchers have found interesting decidable fragments of FOML, have developed many aspects of its proof theory and model theory. It is in this background that this tutorial is planned, to give researchers a perspective on these results, a glimpse of the techniques used and the range of problems that have opened up in this exciting area.

Organizers:

• • R Ramanujam (Azim Premji University, India)

Speakers:

• • Eugenio Orlandelli (University of Bologna, Italy)

  • Anantha Padmanabha (IIT Madras, India)

  • Yanjing Wang (Peking University, China)

  • Reihane Zoghifard (IPM Teheran, Iran)