Completeness of coalition logics with seriality, independence of agents, or determinism
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908531007946752 |
|---|---|
| author | Li, Yinfeng Ju, Fengkui |
| author_facet | Li, Yinfeng Ju, Fengkui |
| contents | 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 in a uniform way. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_14635 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Completeness of coalition logics with seriality, independence of agents, or determinism Li, Yinfeng Ju, Fengkui Computer Science and Game Theory Logic 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 in a uniform way. |
| title | Completeness of coalition logics with seriality, independence of agents, or determinism |
| topic | Computer Science and Game Theory Logic |
| url | https://arxiv.org/abs/2409.14635 |