ConsistentConfig
plain-language theorem explainer
ConsistentConfig pairs a proposition P with a positive real ratio to model a non-contradictory state that can stabilize under cost minimization. Researchers deriving logic from J-cost landscapes cite it as the canonical object for single propositions that reach defect zero. The declaration is a bare structure with three fields and no proof obligations.
Claim. A consistent configuration consists of a proposition $P$ and a positive real ratio $r > 0$.
background
The LogicFromCost module shows that logical consistency arises as the minimum of the J-cost function on configurations. A configuration stabilizes when its defect vanishes, which occurs precisely when the ratio equals 1; contradictions force at least one component to diverge and therefore incur positive or infinite cost. ConsistentConfig encodes a single proposition without its negation, using the cost definition imported from ObserverForcing where cost of a recognition event equals Jcost of its state.
proof idea
The declaration is a direct structure definition that introduces the fields P, ratio, and ratio_pos with no tactics or lemmas applied.
why it matters
ConsistentConfig supplies the type for the central theorems logic_from_cost and why_logic_is_real, which establish that only non-contradictory configurations can achieve zero defect. It realizes the module claim that logic is the structure of cost-minimizing states and feeds the summary table contrasting contradiction cost with consistency cost. The structure closes the step from cost minima to the emergence of logical stability in the Recognition Science forcing chain.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.