LoF expression records and their allowed potential states
DefinitionAPFLoFAshby_RecordControlcontrol-theorylogicrecords
A finite family of Spencer-Brown expressions is evaluated on supplied Boolean readings of an arbitrary state space. The observation is the vector of expression values. Each record requires its corresponding expression to have its recorded value. The allowed cell is the existing RecordOccupant.allowed set for those same records. These definitions supply no physical realization, costs or actual occupant. The same module includes explicit four-state example data: two Boolean coordinates and their LoF difference relation, with no physical interpretation asserted.
Definition code
import Definitions.Def_APFLawsOfForm_Bridge
import Definitions.Def_APFPaper1_RecordOccupant
import Definitions.Def_APFControlCriterion
import Mathlib.Data.Fintype.Fin
/-!
Reference vocabulary connecting existing LoF denotations to RecordOccupant cells.
No physical protocol, price, actual occupant, or admissibility is asserted.
`r` assigns Boolean readings to variables. The finite family F is supplied.
A record profile keeps precisely the values of those expressions; an allowed
state satisfies those same value records. Only attained profiles need responses.
-/
set_option autoImplicit false
namespace APFLoFAshby.RecordControl
variable {X : Type} {n : Nat}
def observe (r : Nat → X → Bool) (F : Fin n → LawsOfForm.Expr)
(x : X) : Fin n → Bool :=
fun i => APFLawsOfForm.denote r (F i) x
def allows (r : Nat → X → Bool) (F : Fin n → LawsOfForm.Expr)
(m : Fin n → Bool) (i : Fin n) (x : X) : Prop :=
APFLawsOfForm.denote r (F i) x = m i
def cell (r : Nat → X → Bool) (F : Fin n → LawsOfForm.Expr)
(m : Fin n → Bool) : Set X :=
APFPaper1.RecordOccupant.allowed (allows r F m) Finset.univ
end APFLoFAshby.RecordControl
/-! Four-state example data, with one LoF expression recording whether two sides differ. -/
namespace APFLoFAshby.RecordControl.Example
def reads (d : Nat) (x : Bool × Bool) : Bool := if d = 0 then x.1 else x.2
def relationExpr : LawsOfForm.Expr :=
.beside (.cross (.beside (.cross (.var 0)) (.var 1)))
(.cross (.beside (.var 0) (.cross (.var 1))))
def family : Fin 1 → LawsOfForm.Expr := fun _ => relationExpr
end APFLoFAshby.RecordControl.Example
Source
Spencer-Brown, Laws of Form, ch.1-2, pp.1-5 (finite Boolean interpretation via existing LawsOfForm formalization); Ashby, An Introduction to Cybernetics, ch.11, secs.11/5-11/12, pp.204-211; existing APFControlCriterion.attained_fiber_policy_iff (c3706923-f731-44de-88e6-ecc07b110fae); existing APFPaper1_RecordOccupant (18067958-d3fd-4e5b-9968-a904a5e6d37e). New semantic correspondence assembly, not a theorem claimed verbatim in either book.