The formulas of modal information logic with finite suprema over the letters A: the Boolean
connectives, the binary modality $\langle\mathrm{sup}\rangle$ and the modality
$\langle\mathrm{sup}^*\rangle$ for joins of nonempty finite sets.
- atom {A : Type u_1} (a : A) : MIL A
- bot {A : Type u_1} : MIL A
- not {A : Type u_1} (φ : MIL A) : MIL A
- or {A : Type u_1} (φ ψ : MIL A) : MIL A
- sup {A : Type u_1} (φ ψ : MIL A) : MIL A
- supStar {A : Type u_1} (φ : MIL A) : MIL A
Used by MIL.den, MIL.top, MIL.and, MIL.P, MIL.H, MIL.iInf, MIL.mem_den_and, MIL.den_P, MIL.mem_den_H, MIL.mem_den_iInf, lit, nePos, neNeg, gamma, Formula.trPos, Formula.trNeg, inqTr, TSFormula.trPos, TSFormula.trNeg