Equality of productive value trees is determined by their positive observations
ProvedTreeEquivalenceHORS.Equivalence.productive_tree_eq_iff_observationscomputabilityrecursion-schemes
Two well-formed productive schemes over the same ranked alphabet generate equal value trees exactly when any two terminals observed at the same address have the same label.
Preamble
import Definitions.Def_TreeEquivalenceHORS_Equivalence_Semantics
Formal statement
namespace TreeEquivalenceHORS.Equivalence
theorem productive_tree_eq_iff_observations {G H : HORS} (hG : G.Valid) (hH : H.Valid)
(alpha : G.alphabet = H.alphabet) (pg : G.Prod) (ph : H.Prod) :
G.BT = H.BT ↔ ∀ w a b, a < G.alphabet.length → b < H.alphabet.length →
G.Obs (.nt G.start) w a → H.Obs (.nt H.start) w b → a = b := by sorry
end TreeEquivalenceHORS.EquivalenceSource
Mingkun Xiao and Yixuan Sun, Tree Equivalence of Higher-Order Recursion Schemes Is Undecidable, §§3 and 5.6. https://arxiv.org/html/2610.39678v1