← All papers
First page of A Four-Valued Graph Model for Conflict Resolution: Core Framework and a Machine-Checked Formalization in Lean 4

A Four-Valued Graph Model for Conflict Resolution: Core Framework and a Machine-Checked Formalization in Lean 4

Yukiko Kato

cs.LO Sep 10, 2026 · v2
Formalizes in Lean 4 with Mathlib the GMCR stability hierarchy, four-valued conjunction properties, reduction operators, and graded reachability for a conflict-resolution framework.
This note consolidates the core of the Quasi-Closed World Graph Model for Conflict Resolution (QCW-GMCR), which extends the standard Graph Model for Conflict Resolution with Belnap's four-valued logic to represent option-level epistemic ambiguity, and pairs the framework with a machine-checked Lean 4 formalization. QCW-GMCR combines: (1) FOUR-valued option assignments with compositional propagation to state-level feasibility; (2) graded reachability (definite, credible, possible) based on an FDE-inspired transition-warrant semantics, with definite reachability related to FDE consequence in the Boolean fragment; (3) axiomatized deterministic reductions from four-valued assessments to binary decisions, including four canonical operators reflecting distinct risk attitudes; and (4) catastrophe-avoiding equilibrium concepts with a quasi-closed-world safety invariant. A four-valued hypergame extension captures heterogeneous subjective assessments across decision makers. We state the core definitions and results and report the parts verified in Lean 4 with mathlib, including the classical GMCR stability hierarchy, algebraic and compositional properties of FOUR-valued conjunction, properties of the canonical reductions, and the graded reachability hierarchy. The formalization also helped identify and correct earlier claims, including a knowledge-monotonicity axiom replaced by truth monotonicity. This preprint provides a stable, citable record of the framework and its current formal verification status.

Standard Graph Models for Conflict Resolution (GMCR) use a binary closed-world epistemology that cannot represent incomplete or contradictory information about options, states, and transitions. The QCW-GMCR framework aims to extend GMCR with Belnap's four-valued logic to represent option-level epistemic ambiguity.

The framework introduces four-valued option assignments with compositional propagation to state feasibility, an FDE-inspired transition-warrant semantics giving graded reachability, deterministic reduction operators mapping four-valued assessments to binary decisions, and catastrophe-avoiding equilibria with a safety invariant. A four-valued hypergame extension captures heterogeneous subjective assessments. Core definitions and results are stated and a subset is verified in Lean 4 with Mathlib.

Lean verification covers the classical GMCR stability hierarchy (Nash ⊆ SMR ⊆ GMR, Nash ⊆ SEQ ⊆ GMR) showing it needs no preference axioms, properties of four-valued conjunction and canonical reductions, and the graded reachability hierarchy. Formalization corrected an earlier knowledge-monotonicity axiom (replaced by truth monotonicity) and identified a false hypergame existence claim.

Paper statementLean identifier(s)
Def. 2.1, Def. 2.2GraphModel, UI, CMove, NashStable
Nash ⊆ SMR ⊆ GMRNashStable.smrStable, SMRStable.gmrStable
Nash ⊆ SEQ ⊆ GMRNashStable.seqStable, SEQStable.gmrStable
CNash ⊆ CSMR ⊆ CGMRcnash_implies_csmr, csmr_implies_cgmr
Selected Lean identifiers for verified statements