Item 51: The deductive coherence region as a computable rational vertex list
Normativity line — traderized enforcement · difficulty substantial · project normativity · closed · node item-51
— answered by the deductive-region round
Answered by the deductive-region round and registered as region.* in projects/normativity/CLAIMS.md. The nonemptiness hypothesis is shown exact rather than merely sufficient. It answers nothing item 42 asks: the enumerator is 2^k in the atoms the stage and fragment mention, and the complexity question is untouched. Record: prompts/2026-08-19-deductive-region/REPORT.md.
Registered results bearing on this item
- region.hull: An image equality, which is the form with content: membership is defined through the hull, so the unfolding form is definitional and says nothing. Duplicate-freeness of the fragment is used in the sur
- region.patterns-complete: Completeness over the priced fragment, with no hypothesis on the fragment: coordinates may repeat or be empty.
- region.patterns-nonempty-iff: A biconditional, so the satisfiability hypothesis is exact rather than merely sufficient: no weaker hypothesis suffices and no stronger one is used.
- region.patterns-sound: Stated with the rational payout table rather than the real-valued one, which is what makes the list rational; the two agree by the repository's existing payout identity.
Where it hangs
- held by normativity