Documentation

DescriptiveComplexity.Problems.Cvp.Hardness.Wiring

The drawn circuit, gate by gate #

What the interpretation of DescriptiveComplexity.Problems.Cvp.Hardness.Interp marks and wires, read back as statements about named points – bdPt, hdPt … – rather than about raw tagged tuples. Two kinds of lemma are needed downstream and both are proved here once:

Everything is stated relative to a minimum m and a maximum M of the universe, which a finite nonempty linear order supplies; the coordinates a tag does not use are pinned to m.

The points #

The marks #

The wires #

Each gate names its left and its right input. The mpr direction builds a derivation, the mp direction inverts one; the constants have no input at all.