GeneralSelfRefQuery
plain-language theorem explainer
A structure packages a real configuration c with a proposition P such that P holds exactly when c fails to stabilize under the RS predicate and stabilization status matches the asserted content. Researchers mapping incompleteness results into cost-minimization dynamics cite this model when recasting Gödel sentences as stabilization queries. The definition directly encodes the two biconditionals that set up the contradiction without lemmas or tactics.
Claim. A structure consisting of a real number $c$, a proposition $P$, the equivalence $P$ iff not RSStab$(c)$, and the equivalence RSStab$(c)$ iff $P$, where RSStab$(c)$ holds precisely when the defect of $c$ is zero.
background
The module dissolves Gödel phenomena inside Recognition Science by treating self-reference as a stabilization query rather than a proof-theoretic sentence. RSStab$(c)$ is the predicate defect $c = 0$, the RS-truth condition for stabilization. The structure generalizes SelfRefQuery by separating the asserted proposition from the config while enforcing that the assertion is exactly the negation of stabilization.
proof idea
This is a structure definition that directly assembles the four fields: the real config, the proposition, the negation-encoding biconditional, and the correctness biconditional. No lemmas are invoked and no tactics are used.
why it matters
The structure supplies the contradictory object whose non-existence is proved in general_self_ref_impossible and packaged inside GodelDissolutionTheorem. It implements the paper's claim that self-referential stabilization queries are non-configurations outside the RS ontology, so that RS closure (unique cost minimizer) is unaffected by Gödel-type gaps. It aligns with the module's reclassification of such queries as oscillating without fixed point under RS dynamics.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.