English

First-Order Coalition Logic

Logic in Computer Science 2025-05-13 v1

Abstract

We introduce First-Order Coalition Logic (FOCL\mathsf{FOCL}), which combines key intuitions behind Coalition Logic (CL\mathsf{CL}) and Strategy Logic (SL\mathsf{SL}). Specifically, FOCL\mathsf{FOCL} allows for arbitrary quantification over actions of agents. FOCL\mathsf{FOCL} is interesting for several reasons. First, we show that FOCL\mathsf{FOCL} is strictly more expressive than existing coalition logics. Second, we provide a sound and complete axiomatisation of FOCL\mathsf{FOCL}, which, to the best of our knowledge, is the first axiomatisation of any variant of SL\mathsf{SL} in the literature. Finally, while discussing the satisfiability problem for FOCL\mathsf{FOCL}, we reopen the question of the recursive axiomatisability of SL\mathsf{SL}.

Keywords

Cite

@article{arxiv.2505.06960,
  title  = {First-Order Coalition Logic},
  author = {Davide Catta and Rustam Galimullin and Aniello Murano},
  journal= {arXiv preprint arXiv:2505.06960},
  year   = {2025}
}

Comments

This is an extended version of the paper with the same title that appears in the proceedings of IJCAI 2025. This version contains a technical appendix with proof details that, for space reasons, do not appear in the IJCAI 2025 version