Docs / Logic / Bilattice / Representation

The representation of interlaced bilattices

import Linglib.Logic.Bilattice.Representation · namespace Bilattice

Every interlaced bilattice B is a product of two lattices: L_B holds the values truth-above the knowledge bottom ⊥ under the truth order, R_B those truth-below it under the reverse order, and x ↦ (x ∨ ⊥, x ∧ ⊥) is an isomorphism of bilattices onto L_B ⊙ R_B with inverse (a, b) ↦ a ⊕ b. The proof rests on one interval law, that a value knowledge-between a and b lies truth-below a ∨ b, whose readings on Bᵒᵈ and Know B make the two orders agree on L_B and inverse on R_B. With a negation the factors coincide, B ≅ L_B ⊙ L_B, and conversely the L_B of a product L ⊙ R is L.

References

  • Avron 1996, The structure of interlaced bilattices

Declarations

L63–66
L104–115
L127–130

Negation

With a negation the two factors coincide: x ↦ (x ∨ ⊥, ¬x ∨ ⊥), whose evidence against x is the evidence for ¬x, represents B as L_B ⊙ L_B under Ginsberg's negation (Avron 1996 Prop 4.7).

def negProductIsoL136–157
{B : Type u_1} [Lattice B] [Lattice (Know B)] [IsInterlaced B] [BoundedOrder (Know B)] [InvolutiveCompl B] [Negation B] :
B ≃o Product ↑(Set.Ici (ofKnow ⊥)) ↑(Set.Ici (ofKnow ⊥))

The definition is too large to print here; read it in the source.

Used by negProductIso_apply, negProductIso_compl, negProductIso_kLE_iff

Used in Fitting1994

Maps of the knowledge order

L183–185
L188–189
L192–193