Docs / Studies / Studies.AloniEtAl2026

Teams, Truthmakers, Translations

Aloni, M., Baltag, A., van Benthem, J., Bezhanishvili, N. & Knudstorp, S. B. (2026).

Bilateral state-based logic (BSL) evaluates a formula at a team, a set of classical valuations, by support and antisupport. Modal information logic (MIL) is a classical modal logic of join-semilattices, whose binary modality $\langle\mathrm{sup}\rangle$ is true at the joins of a point satisfying each argument; truthmaker conjunction is this modality and so is BSL's disjunction. An entailment holds in BSL exactly when its translation holds in MIL over distributive semilattices, under a theory $\Gamma$ fixing the behaviour of the letters, and likewise for inquisitive logic. The proof sends a point to the team of valuations defined by the points below it, which carries a translation to its formula because it lifts splits of teams. Distributivity cannot be dropped.

Implementation notes

Truth sets are mathlib's operations on Set S: $\langle\mathrm{sup}\rangle$ is ⊻, $\langle\mathrm{sup}^*\rangle$ is supClosure, and MIL.P is upperClosure, the inexact verification of truthmaker semantics. Support and antisupport form a pair in the product bilattice ⊙, as do verifiers and falsifiers. The forth condition is proved from Defines.of_le, without the paper's decomposition of a point into parts defining valuations; only the back condition and the atomic cases use the decomposition. The fullness model is the whole powerset rather than that of the team, since a translation inspects only the points below its point of evaluation.

TODO

The fixed-point logic $\mu$MIL, the Boolean negation and dependence atoms of the further team logics, the converse of isRegular_den (Anttila and Knudstorp's expressive completeness), and the K3 variant whose map is the analogue of Birkhoff's.

References

L59–68
L74–81
L102–103
L105
L107–108
L110–111
L113–119

Bilateral state-based logic

L125–133
L141–150

The translation

L172–175
L179–187
L189–197

Literals in a semilattice model

L212–213
L215–216
L227–228
L235–238
L240
L242–244
L246–248
L250–252
L258–260
L267–272
L285–288
L382–394

Lemma 4.10: a split of the team of a point lifts to a split of the point.

theorem exists_sup_eqL396–428
{Atom : Type u} {S : Type u_1} [SemilatticeSup S] {V : Atom × Bool → Set S} {x : S} [Fintype Atom] [IsDistribSemilatticeSup S] [Nonempty Atom] (hx : x ∈ MIL.den V gamma) {s t : Finset (Atom → Bool)} (h : G V x = s ∪ t) :
∃ (y : S) (z : S), y ⊔ z = x ∧ G V y = s ∧ G V z = t

Built from , ,

Lemma 4.11: under $\Gamma$, the translation of a formula is true at a point exactly when the team of the point supports the formula, and likewise for antisupport.

theorem mem_den_trL457–481
{Atom : Type u} {S : Type u_1} [SemilatticeSup S] {V : Atom × Bool → Set S} {y : S} [Fintype Atom] [IsDistribSemilatticeSup S] [Nonempty Atom] (φ : Formula Atom) (hy : y ∈ MIL.den V gamma) :
(y ∈ MIL.den V φ.trPos ↔ G V y ∈ φ.den.pro) ∧ (y ∈ MIL.den V φ.trNeg ↔ G V y ∈ φ.den.con)

Built from , , , , , ,

The fullness model

L502–509
L526–535

Free choice and closure properties

L572–594

Inquisitive logic

L617–626

An entailment between modal-free formulas holds in inquisitive logic exactly when its translation holds under $\Gamma$ in every distributive semilattice model.

theorem inquisitive_consequence_iff§4.8L652–666
{Atom : Type u} [Fintype Atom] [Nonempty Atom] {φ ψ : Inquisitive.Formula Atom} (hφ : φ.IsModalFree) (hψ : ψ.IsModalFree) :
↑(Inquisitive.support inqModel φ) ⊆ ↑(Inquisitive.support inqModel ψ) ↔ ∀ (S : Type u) [inst : SemilatticeSup S] [IsDistribSemilatticeSup S] (V : Atom × Bool → Set S), MIL.den V gamma ∩ MIL.den V (inqTr φ) ⊆ MIL.den V (inqTr ψ)

Built from , , ,

Distributivity cannot be dropped

The truthmaker translation

L745–750