theorem

Theorem 17.2

Unique language from compatible cuts

Theorem 17.2 (Unique language from compatible cuts). Every compatible Boolean cut field determines a unique language LC={w:C∣w∣,0(w,ε)=1}L_C=\{w:C_{|w|,0}(w,\eps)=1\} such that Cm,n(u,v)=1[uv∈LC]C_{m,n}(u,v)=\mathbf 1[uv\in L_C] for every cut. Conversely, every language produces a compatible field.