Truth is a spectrum
Predicates take values in [0, 1]; crisp true and false are the special case {0, 1}. The frozen logic profile uses AND = min, OR = max and NOT = 1 − p.
CVSG is a Chinese-first, rulebook-driven language. Chinese text is how a program is written; the canonical program is a typed semantic graph whose state lives on spectra, not only true and false, and a versioned rulebook decides how each sentence is read.
Chinese surface ≠ canonical program. Text is a view of the graph; the graph is canonical.
The canonical program is G = (V, E, X, R): semantic entities, events, states and operators; typed relations between them; typed variable-spectrum state; and the active rulebook. Chinese is a projection of that structure, and an authoring interface over it.
Predicates take values in [0, 1]; crisp true and false are the special case {0, 1}. The frozen logic profile uses AND = min, OR = max and NOT = 1 − p.
Every program carries a versioned rulebook. Under a different rulebook the same sentence can be read differently, and an ambiguous sentence is kept as explicit candidate graphs instead of failing at once.
Rules run as world-state transitions over a cycle-start snapshot, with deterministic priority, traces, a linked history commitment, checkpoints and replay. O1.0 adds causes scheduled for later cycles.
AI may propose interpretations. Canonical state changes are explicit and versioned, and a committed state never changes silently because a parser, model or rulebook implementation changed.
Two short pieces from the language’s own examples. Time and causality are explicit relations in the graph: the order of the lines alone never becomes world time or a cause.
設甲為村民。
設乙為使者。
甲信任乙。
其懼度0.40,確信0.80,趨向0.10。
因(先(甲信任乙),後(狼近,甲懼增)),故(甲逃)。規則 cvsg.rule:fear-retreat-direction 優先80:若甲懼度至少0.60,則甲趨向減1.20。
規則 cvsg.rule:calm-fear-drop 優先60:若有安撫於甲,則甲懼度減0.25。Each stage closes only after local validation, and no later stage rewrites an earlier one.