{"id":"reopening-oppositions","title":"Operators that reopen a collapsed opposition","regions":["representation","reflexivity","language-and-experience"],"question":"How can a representation sustain recurrent opposition without collapsing all differences into one thesis?","formulation":"Explore operators for recurrent transformation, unification, and reopening a unified formulation; permit a text to be continued from a collapse rather than accepting collapse as its final reading.","representations":[{"name":"Opposition expressed in prose","affords":"Preserves interpretive nuance.","loses":"Recurring transformations can be hard to compare.","epistemic_kind":"reconstruction"},{"name":"A family of symbolic operators","affords":"Makes a proposed transformation repeatable.","loses":"An assigned glyph is not yet a formally defined operation.","epistemic_kind":"reconstruction"}],"tension":"A unifying formulation can be useful and still erase the differences that made a problem worth pursuing.","challenge":"Does a proposed reopening operator change the available interpretations, or only rename the closure?","development":"historical_branch","epistemic_kind":"reconstruction","evidence":["basis-reopening-oppositions"],"next_move":{"text":"Compare two operator systems on the same short invented text and record different results and undefined steps.","epistemic_kind":"model_proposed"},"open_questions":["How can a representation sustain recurrent opposition without collapsing all differences into one thesis?","Does a proposed reopening operator change the available interpretations, or only rename the closure?"],"formal_status":"open_problem","version":1,"content_hash":"fb6303510149ba7969b55ad2ab28173088ec34d82e3e8ea3a05bfffb969e9371"}