×

A solution to the completeness problem for weakly aggregative modal logic. (English) Zbl 0837.03016

The modal logic \(K_n\) which is obtained from \(K\) by replacing the usual schema \(\square \alpha \wedge \square \beta \to \square (\alpha \wedge \beta)\) with the schema of “\(n\)-ary aggregation” \[ \square \alpha_0 \wedge \cdots \wedge \square \alpha_n. \to. \square \bigwedge_{(0 \leq i < j \leq n)} (\alpha_i \wedge \alpha_j) \] is complete w.r.t. Kripke-style semantics, where in a frame \(\langle W,R \rangle\), \(R\) is an \(n\)-ary relation on \(W\), and the \(\square\)-point in the definition of truth at a world of a model is \[ \models_w \square \alpha \text{ iff } (\forall x_1, \dots, x_{n - 1} \in W) \bigl( Rw, x_1, \dots, x_{n - 1} \Rightarrow (\exists i, 1 \leq i < n) \models_{x_i} \alpha \bigr). \]

MSC:

03B45 Modal logic (including the logic of norms)
Full Text: DOI

References:

[1] DOI: 10.1007/BF00935743 · Zbl 0595.03010 · doi:10.1007/BF00935743
[2] Logics of time and computation (1978)
[3] Modal logic: an introduction (1980)
[4] DOI: 10.1007/BF02379122 · doi:10.1007/BF02379122
[5] DOI: 10.1305/ndjfl/1093883512 · Zbl 0472.03014 · doi:10.1305/ndjfl/1093883512
[6] DOI: 10.1007/BF00248398 · Zbl 0442.03020 · doi:10.1007/BF00248398
[7] DOI: 10.1002/malq.19800261904 · Zbl 0467.03013 · doi:10.1002/malq.19800261904
[8] DOI: 10.1305/ndjfl/1093883516 · Zbl 0472.03015 · doi:10.1305/ndjfl/1093883516
[9] Paraconsistent logic pp 306– (1989) · Zbl 0697.03016
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.