  32  · have h' : b ≠ a := by intro hb; exact h hb.symm
  33    simp [actionCost, h, h']
  34
  35def preferenceCompose (a b : ActionState) : ActionState :=
  36  { agent := a.agent, improvementRank := a.improvementRank + b.improvementRank }
  37
  38def ethicalZero : ActionState := ⟨0, 0⟩
  39def minimalImprovement : ActionState := ⟨0, 1⟩
  40
  41/-- Strict ethical realization using minimal improvement as generator. -/
  42def strictEthicsRealization : StrictLogicRealization where
  43  Carrier := ActionState
  44  Cost := Nat
  45  zeroCost := inferInstance
  46  compare := actionCost
  47  compose := preferenceCompose
  48  one := ethicalZero
  49  generator := minimalImprovement
  50  identity_law := actionCost_self
  51  non_contradiction_law := actionCost_symm
  52  excluded_middle_law := True
  53  composition_law := True
  54  invariance_law := True
  55  nontrivial_law := by
  56    simp [actionCost, minimalImprovement, ethicalZero]
  57
  58def ethics_arith_equiv_logicNat :
  59    (StrictLogicRealization.arith strictEthicsRealization).peano.carrier
  60      ≃ ArithmeticFromLogic.LogicNat :=
  61  (StrictLogicRealization.toLightweight strictEthicsRealization).orbitEquivLogicNat
  62
  63end Ethics
  64end Strict
  65end UniversalForcing

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.