{"id":"visitor-recursive-computation-encapsulation-bounded","text":"Visitor's doubly-extensible recursive computation (stateful accumulation across elements, extensible along both type and operation axes via bidirectional OCP) is bounded by Visitor's encapsulation cost: element classes must expose enough internal state for visitors to operate, meaning recursive computation extensibility trades off against information hiding — a tension inherent in OCP axis inversion.","truth_value":"OUT","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["visitor-recursive-stateful-operations","composite-visitor-dual-ocp-coverage"],"outlist":["gof-visitor-breaks-encapsulation"],"label":"Doubly-extensible recursive computation is powerful but requires elements to expose state"}],"dependents":[],"metadata":{"source_type":"derived"},"created_at":"2026-06-17T23:41:07+00:00","updated_at":"2026-06-17T23:41:07+00:00","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"visitor-recursive-computation-encapsulation-bounded","truth_value":"OUT","reason":"SL justification invalid","failed_antecedents":[],"label":"Doubly-extensible recursive computation is powerful but requires elements to expose state","violated_outlist":["gof-visitor-breaks-encapsulation"]}]}}