Completeness of coalition logics with seriality, independence of agents, or determinism
<|reference_start|>Completeness of coalition logics with seriality, independence of agents, or determinism: Coalition Logic is a central logic in logical research on strategic reasoning. In a recent paper, Li and Ju argued that generally, models of Coalition Logic, concurrent game models, have three too strong assumptions: seriality, independence of agents, and determinism. They presented a Minimal Coalition Logic based on general concurrent game models, which do not have the three assumptions. However, when constructing coalition logics about strategic reasoning in special kinds of situations, we may want to keep some of the assumptions. Thus, studying coalition logics with some of these assumptions makes good sense. In this paper, we show the completeness of these coalition logics by a uniform approach.<|reference_end|>
@article{li2024completeness,
    title={Completeness of coalition logics with seriality, independence of agents,
  or determinism},
    author={Yinfeng Li and Fengkui Ju},
    journal={arXiv preprint arXiv:2409.14635},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.14635},
    primaryClass={cs.GT math.LO}
}