The Contradiction Trap: A Dialectical and Game-Theoretic Framework for Exposing Structural Bias

The Contradiction Trap: A Dialectical and Game-Theoretic Framework for Exposing Structural Bias James Atkinson 2025 Abstract This paper introduces the contradiction trap: a dialectical and game-theoretic instrument for exposing bias, inconsistency, and concealed motive by forcing a system to reconcile mutually exclusive commitments. Rooted in reductio ad absurdum but extended into an evidential method, the trap treats contradiction as a structured signal: what breaks under tension reveals its underlying architecture. Modelled as a one-move epistemic game, the trap extracts information by design, converting asymmetry into measurable evidence. The result is a portable diagnostic for testing neutrality claims across law, governance, and algorithmic systems. Rather than asking systems to defend their integrity, the method places them under controlled transformation and observes what persists. In this way, contradiction becomes not an endpoint but a foundation for evidential clarity. This paper is the first in a planned trilogy developing a general evidential framework for reasoning, allocation, and institutional integrity. Keywords: institutional integrity; admissible symmetry; behavioural invariance; metamorphic testing; e-processes; PRIME adaptation; projected stochastic approximation; constitutional governance; evidential accountability; sentinel logic. 1 Contents 1 Introduction 5 2 Related Works 6 2.1 Dialectical and Logical Foundations . . . . . . . . . . . . . . . . . . . 6 2.2 Epistemic Game Theory and Information Dynamics . . . . . . . . . . 7 2.3 Structural Bias, Auditing, and Algorithmic Accountability . . . . . . . 8 2.4 Contemporary Developments . . . . . . . . . . . . . . . . . . . . . . . 8 2.5 Synthesis................................... 9 3 Contribution and Novelty 9 3.1 From Proof to Performance. . . . . . . . . . . . . . . . . . . . . . . . . 9 3.2 Quantification of Contradiction. . . . . . . . . . . . . . . . . . . . . . . 10 3.3 Integration with Algorithmic Accountability. . . . . . . . . . . . . . . . 10 4 Definition and Core Structure 11 4.1 FormalDefinition .............................. 11 4.2 The Generic R-N-f(P) Framework . . . . . . . . . . . . . . . . . . . . . 12 4.3 TheCoreProperty.............................. 13 5 Origins and Distinction 13 6 Coherence Cost Estimation Methods: Selection and Validation 15 6.1 Comparative Framework . . . . . . . . . . . . . . . . . . . . . . . . . . 15 6.2 Scaling and Performance . . . . . . . . . . . . . . . . . . . . . . . . . . 17 6.3 Null Model and Significance Testing . . . . . . . . . . . . . . . . . . . 17 6.4 Method Selection Guidance . . . . . . . . . . . . . . . . . . . . . . . . 17 6.5 Multi-Method Validation . . . . . . . . . . . . . . . . . . . . . . . . . . 18 7 Methodology for Contradiction Games 19 7.1 Purpose ................................... 19 7.2 InputsandArtefacts ............................ 19 7.3 Construction of the Trap . . . . . . . . . . . . . . . . . . . . . . . . . . 19 7.4 Measurement and Quantification . . . . . . . . . . . . . . . . . . . . . 20 7.4.1 Coherence Cost 𝐶(𝑐𝑟)........................ 20 7.4.2 Accumulation Models . . . . . . . . . . . . . . . . . . . . . . . 21 7.5 Meta-Moves and Secondary Signals . . . . . . . . . . . . . . . . . . . 21 8 Structural Contradiction Analysis 21 8.1 Worked Examples at Full Structural Rigour . . . . . . . . . . . . . . . 22 8.1.1 Example 1: Organisational Restructure . . . . . . . . . . . . . 22 2 8.1.2 Example 2: Algorithmic Hiring Audit . . . . . . . . . . . . . . . 23 8.1.3 Example 3: Legal Consistency Test . . . . . . . . . . . . . . . . 23 8.2 Meta-Move Classification . . . . . . . . . . . . . . . . . . . . . . . . . 24 8.3 Evasion Composite Index (ECI) . . . . . . . . . . . . . . . . . . . . . . 24 8.4 Robustness Under Perturbation . . . . . . . . . . . . . . . . . . . . . . 25 8.5 Synthesis: Contradiction as Diagnostic Evidence . . . . . . . . . . . . 25 9 Applications Across Domains 26 9.1 Legal and Regulatory Analysis . . . . . . . . . . . . . . . . . . . . . . . 26 9.2 AI Fairness and Algorithmic Auditing . . . . . . . . . . . . . . . . . . . 26 9.3 Organisational Governance and Decision Systems . . . . . . . . . . . 27 9.4 Philosophical and Epistemic Inquiry . . . . . . . . . . . . . . . . . . . 27 9.5 Media Systems (Neutral Case Study) . . . . . . . . . . . . . . . . . . . 27 10 Analytical Function 28 10.1 Overview................................... 28 10.2 ControlledFraming............................. 28 10.3 Response Inevitability . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 10.4 Diagnostic Inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 10.5 DocumentaryValue............................. 30 10.6 AnalyticalOutputs ............................. 30 10.7 From Logic to Measurement . . . . . . . . . . . . . . . . . . . . . . . . 30 11 The Core Principle: Asymmetry Without Necessity Shifts the Burden Toward Intent 32 11.1 Evidential Interpretation . . . . . . . . . . . . . . . . . . . . . . . . . . 33 11.2 Boundaries and Caveats . . . . . . . . . . . . . . . . . . . . . . . . . . 33 11.3 Multi-Agent and Recursive Cases . . . . . . . . . . . . . . . . . . . . . 34 12 Game-Theoretic Formalisation 34 12.1 FormalDefinition .............................. 34 12.2 Epistemic Constant-Sum . . . . . . . . . . . . . . . . . . . . . . . . . . 35 12.3 Payoffs and Information . . . . . . . . . . . . . . . . . . . . . . . . . . 35 12.4 Equilibrium Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 12.5 Information-Theoretic Interpretation . . . . . . . . . . . . . . . . . . 37 12.6 Comparative Game-Theoretic Structure . . . . . . . . . . . . . . . . . 37 12.7 StrategicDynamics............................. 37 12.8 BoundedCoherence ............................ 38 12.9 Interpretive Consequence . . . . . . . . . . . . . . . . . . . . . . . . . 39 12.10 Bounded Coherence in Practice . . . . . . . . . . . . . . . . . . . . . . 39 12.11 EthicalGuardrails.............................. 39 12.12 ProhibitedUses............................... 40 3 13 Future Research Programme 41 13.1 Empirical Validation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 13.2 Theoretical Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 13.3 Methodological Development . . . . . . . . . . . . . . . . . . . . . . . 42 13.4 Applied Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . 42 14 Summary of Contributions 43 15 Conclusion 43 Appendix A: Quick Reference Card 45 Appendix B: Methodology for Contradiction Games 46 Appendix C: Quick-Start Checklist (Practitioner Version) 49 Appendix D: Glossary of Specialist Terms 49 Appendix E: Worked Example (Generic) 50 Appendix F: Worked Example (Tribunal Scenario, Anonymised) 51 Appendix G: Estimator Pseudocode 52 4 1 Introduction Contradiction has long served as the philosopher’s stress test of truth. From the Socratic elenchus to Aristotle’s law of non-contradiction and the modern reductio ad absurdum (Socratic method: Benson; reductio: Groarke), contradiction has functioned as philosophy’s diagnostic heartbeat: when a position collapses in on itself, it radiates its own refutation. Yet, while classical logic isolates contradiction within propositions, organisational and institutional reasoning often conceals contradiction within systems. This paper formalises a method for locating those contradictions, not in abstract syntax, but in an applied reasoning framework — a procedural trap that converts rhetoric into data. The contradiction trap extends logic from proof to performance. By structuring a question where every available answer contradicts a distinct part of the respondent’s declared logic, it transforms a qualitative dispute into an epistemic experiment. In doing so, it reframes contradiction as evidence: a measurable, reproducible signal of bias or concealed motive. This situates logical analysis within practical domains such as governance, ethics, and algorithmic accountability, providing a portable tool for interrogating systems that claim neutrality yet behave with asymmetry. Glossary note. Key technical terms used throughout this paper include: coherence cost (the measurable strain within a reasoning system when commitments conflict), epistemic game (a structured interaction in which agents’ beliefs depend on one another’s reasoning consistency), and meta-evasion score (a behavioural index capturing secondary avoidance tactics such as reframing or delay). A complete glossary is provided in Appendix 15. While the contradiction trap introduces a novel formal and epistemic framework, it emerges from a broader lineage of research in dialectical reasoning, epistemic game theory, and algorithmic accountability. The following section situates this work within that interdisciplinary context, tracing how earlier theories of dialectical games, belief revision, and audit-based inference inform the trap’s design. By connecting these traditions, we clarify both the conceptual ancestry and the practical novelty of treating contradiction as a measurable epistemic signal rather than a logical failure. Lemma 1.1 (Inevitability of Inconsistency).Let 𝒞∶{𝑃1,𝑃2}→𝑂 (1.1) be a clarity configuration with stated rationale 𝑅and narrative justification 𝑁. Suppose that for each pathway 𝑃𝑖: 5 1. 𝑃𝑖preserves 𝑁only by contradicting 𝑅, and 2. 𝑃𝑖preserves 𝑅only by contradicting 𝑁. Then every admissible 𝑃𝑖produces an outcome 𝒞(𝑃𝑖)that is inconsistent with either 𝑅or 𝑁. Inconsistency is therefore unavoidable and independent of agent intent. Proof. For each 𝑃𝑖, either (1) 𝑁is preserved at the cost of contradicting 𝑅, or (2) 𝑅is preserved at the cost of contradicting 𝑁. Because {𝑃1,𝑃2}exhausts the admissible response set, no pathway simultaneously preserves both commitments. Thus every 𝑃𝑖 yields an outcome inconsistent with at least one of 𝑅or 𝑁. The value of Constructio ad Claritatem lies not in the contradiction itself but in the structural information revealed by it. By collapsing the agent’s discretion into a minimal two-pathway decision-space, the configuration separates the professed rationale of the system from its operative motive. The mathematical analysis that follows treats clarity configurations as diagnostic objects: small, adversarial structures that reveal inconsistency without requiring confrontation, intent analysis, or subjective interpretation. Roadmap. This paper forms the opening part of a larger programme. A second paper develops a stochastic, self-correcting analogue of fairness, and a third generalises these principles into a falsifiable architecture for institutional integrity. Together, they outline a unified evidential approach to claims of neutrality across reasoning, allocation, and governance. 2 Related Works The contradiction trap arises at the intersection of three research traditions: dialectical reasoning and logical games,epistemic game theory, and bias auditing and epistemic accountability. Each contributes a structural insight that the trap consolidates into a single diagnostic framework. 2.1 Dialectical and Logical Foundations The intellectual roots of the contradiction trap lie in the long history of dialectical reasoning, from the Socratic elenchus to formal dialogue games in modern logic. Woods 6 and Walton’s analysis of Question-begging and Cumulativeness in Dialectical Games showed that dialogical exchanges can be modelled as competitive epistemic structures in which contradiction exposes circularity or bias rather than mere error (Woods and Walton). In their formulation, epistemic defeat — not persuasion — marks logical victory. The contradiction trap extends this lineage by converting contradiction into measurable information gain rather than rhetorical failure. Floridi’s conception of transparency as epistemic accountability (Floridi) reinforces this shift: contradiction becomes a mechanism of verification through exposure, not a flaw. Structural-dialectical psychology reaches the same conclusion from a different angle. Veraksa et al. describe contradiction as a dynamic interplay of oppositions that mutually exclude and presuppose one another (Veraksa et al.). This aligns with the trap’s treatment of inconsistency not as breakdown but as evidence of structural tension within reasoning systems. Where classical logic isolates contradiction within propositions, the trap operates across systems of commitments, transforming qualitative opposition into quantitative signal. Computational models of argumentation provide additional grounding. Wells’s work on Cumulativeness in Dialectical Games identifies formal mechanisms for aggregating reasoning moves and classifying game types by epistemic persistence (Wells). The contradiction trap is a specific subclass of such games — strictly competitive and lossdeterministic — where each move by the respondent necessarily incurs coherence cost. It therefore fits squarely within what Wells calls “cumulative dialectical architectures,” where epistemic state transitions accumulate evidence of internal inconsistency. 2.2 Epistemic Game Theory and Information Dynamics Game-theoretic approaches to epistemic reasoning investigate how information, belief, and contradiction evolve during interaction. Benthem’s Games in Dynamic Epistemic Logic formalised the dynamics of information change in imperfect-information games by linking logical operations to epistemic updates through modal structure (Benthem). In the contradiction trap, information gain (Δ𝐼) and coherence cost (𝐶) mirror this structure: contradiction forces an epistemic update that reduces uncertainty about a system’s internal logic. Li and Wang’s From Rules to Runs deepens this insight by separating rule structures from actual play sequences in imperfect-information games, enabling stepwise tracking of epistemic change (Li and Wang). This corresponds directly to the trap’s distinction between stated rationales (𝑅) and narrative justifications (𝑁), whose forced reconciliation yields measurable contradiction. 7 Dufwenberg and Lindén’s analysis of Inconsistencies in Extensive Games showed that epistemic contradictions arise even under minimal rationality assumptions (Dufwenberg and Lindén). Their call for belief-revision mechanisms is instantiated in the trap: contradiction becomes the empirical signal for updating beliefs about motive or bias. Weirich’s Epistemic Game Theory and Logic synthesises these ideas by framing games as instruments for reasoning about knowledge and justification rather than material payoff (Weirich). The trap operationalises this epistemic orientation by defining utilities in informational rather than material terms: coherence loss for one player equals informational gain for the other. 2.3 Structural Bias, Auditing, and Algorithmic Accountability Algorithmic auditing applies game-theoretic reasoning to detect bias and information asymmetry in complex systems. Blocki et al.’s Audit Games with Multiple Defender Resources generalised Stackelberg security models to multi-resource audit contexts, treating information asymmetry as a strategic dimension (Blocki et al.). Their framework demonstrates how informational payoffs can replace material ones — a conceptual precursor to the trap’s epistemic payoffs. Embedding contradiction traps into audit pipelines thus enables qualitative inconsistency to be measured as quantitative evidence. Dianat and Orgun’s Modelling Bayesian Attacker Detection Game in Wireless Networks introduces epistemic logic into adversarial monitoring (Dianat and Orgun). Their treatment of reasoning consistency as a signal of reliability parallels the trap’s approach: both interpret adversarial interaction as a vehicle for evidential inference. Together, these works converge on a key insight: contradiction, when structured within epistemic or dialectical games, functions as a form of diagnostic transparency. Rather than indicating simple error, it reveals the boundaries of coherence within a system’s justificatory architecture. The contradiction trap formalises this insight into a portable “epistemic audit game,” where asymmetry without necessity becomes probabilistic evidence of intent. 2.4 Contemporary Developments Recent developments extend the dialectical and epistemic principles underlying the contradiction trap into modern audit and AI contexts. Yang et al. treat transparency, privacy, and accountability as Stackelberg-style epistemic games whose equilibria correspond to stable disclosure strategies (Yang, Zhang, and Zhu). Mökander’s ethics-based 8 audits and Buhmann et al.’s analysis of algorithmic accountability frame auditing as institutionalised dialogue (Mökander; Buhmann, Paßmann, and Fieseler), aligning directly with the trap’s adversarial epistemic design. Philosophically, this trend resonates with Watson and Floridi’s sociotechnical pragmatism (Watson, Mökander, and Floridi) and Fisher’s account of communicative contradiction (Fisher), both of which view epistemic conflict as a prerequisite for transparent reasoning. These developments situate the contradiction trap within a modern lineage connecting dialectical logic to practical audit architectures. 2.5 Synthesis Across these traditions, contradiction emerges not as a mere logical error but as a diagnostic signal of structural tension within reasoning systems. The contradiction trap formalises this by transforming contradiction from a descriptive feature of dialogue or belief revision into a quantitative epistemic instrument. The next section defines its core structure, showing how the interaction between a system’s declared rationale (𝑅) and narrative defence (𝑁) can be cast as a game in which every consistent response incurs a measurable coherence cost. 3 Contribution and Novelty While contradiction has been central to logic, dialectic, and epistemic game theory, these traditions have typically treated it as a descriptive feature of reasoning rather than adiagnostic one. This paper introduces three innovations that convert contradiction from a theoretical construct into a measurable epistemic instrument. 3.1 From Proof to Performance. Classical and dialectical traditions — from the elenchus to formal dialogue games — use contradiction to reveal inconsistencies in argumentation. The contradiction trap reframes this as an epistemic performance: contradiction is engineered, not merely observed, and its occurrence becomes an actionable signal of bias within reasoning systems. This move extends Woods and Walton’s dialectical games (Woods and Walton) and Benthem’s dynamic epistemic logic (Benthem) by turning contradiction into a procedural test of structural coherence. 9 (1) Rule-Based Coherence (RB-C) RB-C operates on explicit commitments expressed in a rule language ℛ, identifying contradictions as minimal violation sets. The logical substrate may be propositional, deontic, or modal depending on the domain. 𝐶RB(𝑐𝑟)=min{|𝑆|∶𝑆⊆(𝑅∪𝑁),(𝑅∪𝑁)∖𝑆is consistent under ℐ}.(6.1) Complexity: 𝑂(𝑛). Highly interpretable and reproducible; ideal for regulatory, contractual, or policy corpora where commitments are explicit. (2) Graph-Informed Coherence (GI-C) GI-C models commitments as a directed graph 𝐺=(𝑉,𝐸) (6.2) 𝑉=𝑅∪𝑁 (6.3) and quantifies contradiction as the size of the minimal hitting set required to restore consistency: 𝐶GI(𝑐𝑟)=|HitSetmin(𝑟)| (6.4) HitSetmin(𝑟)=min{𝑆⊆𝑉∶𝐺+(6.5) where S is acyclic and consistent. Complexity: 𝑂(𝑛log 𝑛). GI-C is suitable for hierarchical or interdependent propositions, and aligns with minimal-conflict-set detection in argumentation frameworks. (3) Semantic Distance Coherence (SD-C) SD-C estimates latent contradiction in unstructured or natural-language corpora. Each proposition 𝑞∈𝑄𝑟 is embedded as a vector 𝑣and compared with its coherence-preserving projection 𝑣′: 𝐶SD(𝑐𝑟)=∑ 𝑞∈𝑄𝑟(1−cos(𝑣,𝑣′))(6.6) Complexity: 𝑂(𝑛2). Cosine distance is the default, though KL divergence or Wasserstein distance may be substituted when embeddings capture stance or implication rather than lexical content. Interpretation. SD-C is well-suited to NLP-based audits, implicit-bias detection, and model interpretability contexts where semantic drift is central to coherence loss. 16 6.2 Scaling and Performance Approximate computational scaling: RB-C: 𝑂(𝑛) (6.7) GI-C: 𝑂(𝑛log 𝑛) (6.8) SD-C: 𝑂(𝑛2)(6.9) For a typical corpus of 𝑛=500-1,000propositions: • RB-C executes in milliseconds; • GI-C executes in sub-second time; • SD-C executes in minutes, depending on embedding dimensionality. RB-C and GI-C are therefore appropriate for live audits or iterative simulations; SD-C is best reserved for retrospective or high-fidelity evaluations. 6.3 Null Model and Significance Testing To assess significance, randomise labels within symmetric inputs 𝑋(permutation test) to obtain bootstrap samples 𝒞0={𝐶(𝑏) 0}𝐵 𝑏=1 (6.10) Compute the normalised statistic 𝑧=𝐶(𝑐𝑟)−𝜇0 𝜎0(6.11) 𝐴=|𝐶𝐺−𝐶𝐷|(6.12) where 𝐴represents the magnitude of asymmetry between the grant and deny branches. Decision rule. Flag incoherence when 𝐴≥𝜏𝐴(6.13) and 𝑧≥𝜏𝑧(6.14) with default thresholds 𝜏𝐴=0.2and 𝜏𝑧=2. For small 𝑛, bootstrap confidence intervals around (𝜇0,𝜎0) mitigate estimator instability. 6.4 Method Selection Guidance Estimator choice should follow the epistemic structure of the data: •RB-C for explicit, rule-governed commitments (legal, contractual, regulatory). 17 •GI-C for hierarchical or interdependent reasoning structures (causal networks, decision trees). •SD-C for semantic drift or latent contradiction (narratives, model explanations). As a best practice, apply at least two estimators in parallel. Agreement indicates internal coherence; divergence indicates epistemic instability: |𝐶1−𝐶2|<𝜖⇒coherent (6.15) |𝐶1−𝐶2|>𝜖⇒unstable (6.16) Tolerance may be defined as 𝜖=𝛼  𝐶, 𝛼∈[0.05,0.15] (6.17) where  𝐶is the mean coherence cost across estimators. 6.5 Multi-Method Validation A multi-method validation pipeline is recommended: 1. Extract and normalise all commitments. 2. Ensure the dependency graph is well-formed (acyclic where required, with consistent edge semantics). 3. Verify embedding fidelity or distance metrics for SD-C. 4. Investigate residual contradictions or unexplained variance between estimators. Heuristic Constructor. 1. Extract 𝑅and 𝑁. 2. Build 𝐺0. 3. Identify a symmetric locus 𝑋exposing opposing closures in 𝑅and 𝑁. 4. Synthesise 𝑓(𝑃)with a minimal edit stressing both subsets. 5. Verify counterfactuals: both 𝐺and 𝐷yield 𝐶>0under 𝑋. 6. Register, test, and record results. Summary. These three estimators constitute the quantitative backbone of contradiction games, converting qualitative disagreement into measurable epistemic strain. The next section formalises this process by defining a reproducible protocol for constructing, executing, and auditing a Contradiction Game across organisational, legal, and algorithmic domains. 18 Table 4: Worked example of coherence-cost estimation across contradictory reasoning pairs. Reasoning Pair (𝑅,𝑁) Proposition 𝑃𝑖𝑓(𝑃𝑖)Outcome Coherence Cost 𝐶(𝐺𝑖)Asymmetry 𝐴𝑖 𝑅1: “Policy ensures parity” 𝑁1: “Outcomes remain unequal” 𝑃10.35 0.66 0.31 𝑅2: “Resource limits justify variance” 𝑁2: “Resources constant” 𝑃20.22 0.48 0.26 𝑅3: “Transparency builds trust” 𝑁3: “Opaque review process” 𝑃30.28 0.57 0.29 Mean — — 0.57 0.29 Illustrative example. Higher coherence cost 𝐶(𝐺)and asymmetry 𝐴increase the posterior odds of motivated deviation, signalling potential intent bias. 7 Methodology for Contradiction Games 7.1 Purpose Contradiction games test whether a system’s stated rationale 𝑅and its narrative justifications 𝑁remain jointly coherent when subjected to a symmetric stressor. Every admissible response incurs positive coherence cost, enabling structural bias to be expressed as a measurable epistemic outcome. 7.2 Inputs and Artefacts •Rationale set 𝑅: written policies, rules, or formal commitments. •Narrative set 𝑁: justificatory explanations accompanying 𝑅. •Symmetric locus 𝑋: cases where neutrality implies identical treatment. •Framing operator 𝑓: constructs the test proposition 𝑃. 7.3 Construction of the Trap 1. Map commitments. Extract 𝑅={𝑟𝑖}and 𝑁={𝑛𝑗}; build a dependency graph 𝐺0=(𝑅∪𝑁,𝐸0). 2. Identify symmetric pressure. Choose 𝑋such that neutrality implies coherence under both outcomes. 19 3. Define 𝑓(𝑃).Frame a binary proposition where: 𝐺∶preserves 𝑅and contradicts 𝑁, 𝐷∶preserves 𝑁and contradicts 𝑅. 4. Specify epistemic payoffs. Player utilities are defined by coherence cost: 𝑈𝐴(𝑟)=𝐶(𝑐𝑟)(7.1) 𝑈𝐵(𝑟)=−𝐶(𝑐𝑟)(7.2) 𝐶(𝑐𝑟)>0 (7.3) No best response exists for 𝐵, yielding no equilibrium. 7.4 Measurement and Quantification 7.4.1 Coherence Cost 𝐶(𝑐𝑟) We adopt four compatible estimators: (1) Rule-Based (RB-C) 𝐶RB(𝑐𝑟)=min{|𝑆|∶𝑆⊆𝑅∪𝑁,(𝑅∪𝑁),𝑆is consistent }(7.4) (2) Graph-Informed (GI-C) 𝐶GI(𝑐𝑟)=|HitSetmin(𝑟)| (7.5) HitSetmin(𝑟)=min{𝑆⊆𝑉∶𝐺+∖𝑆is acyclic and consistent}(7.6) (3) Semantic Distance (SD-C) 𝐶SD(𝑐𝑟)=∑ 𝑞∈𝑄𝑟(1−cos(𝑞,𝑞′))(7.7) where 𝑞′is the projection of 𝑞onto the admissible closure 𝒦𝑟. (4) Model-Checking Penalty (MC-C) Minimal number of edits or constraint removals required to restore satisfiability in a formal model. Normalisation. When combining estimators, coherence cost is normalised: 𝐶∗(𝑐𝑟)=1 𝑚𝑚 ∑ 𝑗=1𝐶𝑗(𝑐𝑟)∈[0,1] (7.8) 20 7.4.2 Accumulation Models Given a reasoning chain ℛ𝑟={𝑞1,…,𝑞𝑛}: 𝐶Σ(𝑐𝑟)= 𝑛 ∑ 𝑖=1𝜔𝑖𝛿(𝑞𝑖)(7.9) 𝐶max(𝑐𝑟)=max 𝑖𝛿(𝑞𝑖)𝐶max(𝑐𝑟)=max 𝑖𝛿(𝑞𝑖)(7.10) Interpretation. 𝐶Σcaptures distributed incoherence; 𝐶max isolates dominant failures. Legal or safety domains typically adopt 𝐶max; organisational diagnostics favour 𝐶Σ. 7.5 Meta-Moves and Secondary Signals Evasive behaviour is modelled through a meta-evasion score 𝑀: 𝑀=∑𝑖𝑤𝑖𝑒𝑖 ∑𝑖𝑤𝑖(7.11) with 𝑒𝑖denoting frequency or magnitude of each recognised meta-move and 𝑤𝑖its diagnostic weight. Meta-moves include: •Reframing (legitimate if symmetry preserved). •Deferral (procedural delay). •Ambiguity (vague or content-free responses). The joint inference model treats coherence cost and evasion as orthogonal: 𝑃(intent ∣𝐶,𝑀)∝(1−𝑒−𝐶)(1−𝑒−𝑀)(7.12) 8 Structural Contradiction Analysis This chapter presents the applied analytical machinery of the R–N–𝑓(𝑃)framework. It unifies structural contradiction diagnostics, branch-level coherence scoring, meta-move classification, and temporal evasion analysis. The goal is evidential: to determine when a system’s own commitments cannot be jointly satisfied under symmetric pressure. Contradiction is not treated as failure but as data: a structural witness to inconsistency in stated rationale, narrative constraints, and observed or implied behaviour. The methods presented here parallel the formal appendix used in applied evidential analysis (e.g., organisational disputes, AI audits, regulatory inconsistency), but remain domain-agnostic and portable. 21 The chapter is organised as follows. Section 8.1 provides rigorously specified structural examples. Section 8.2 outlines the taxonomy of meta-moves and their evidential coding. Section 8.3 introduces the Evasion Composite Index (ECI). Section 8.4 establishes perturbation robustness. Section 8.5 summarises the inferential architecture. 8.1 Worked Examples at Full Structural Rigour The following examples apply the structural method used in formal contradiction analysis: explicit declaration of rationale ℛ, narrative 𝒩, observed actions 𝐴, the symmetric test proposition 𝑓(𝑃), branch-level coherence loss, and minimal removal sets. 8.1.1 Example 1: Organisational Restructure Rationale. ℛ={𝑟1∶parallel leadership, 𝑟2∶efficiency, 𝑟3∶titles reflect scope, 𝑟4∶no substantive change.} (8.1) Narrative. 𝒩={𝑛1∶not personal, 𝑛2∶no replacement, 𝑛3∶no diminution, 𝑛4∶consultation adequate.}(8.2) Observed actions. 𝐴={𝑎1∶new Head role, 𝑎2∶direct report reassigned, 𝑎3∶no consultation.}(8.3) Test proposition. 𝑓(𝑃)=“If no replacement occurred, scope must remain unchanged, and should have parity of title.” Contradiction. Granting 𝑓(𝑃)contradicts 𝑎1,𝑎2. Denying 𝑓(𝑃)contradicts 𝑟3,𝑟4,𝑛1,𝑛2,𝑛3. 𝐶(𝐺)=38, 𝐶(𝐷)=58.(8.4) Minimal removal set. 𝑆min ={𝑟3,𝑟4,𝑛1,𝑛2,𝑛3,𝑛4}, 𝐶=68=0.75. (8.5) A structural contradiction: the system can satisfy at most two of its eight commitments simultaneously. 22 8.1.2 Example 2: Algorithmic Hiring Audit Rationale. ℛ={𝑟1∶strict merit, 𝑟2∶identical assessment conditions.}(8.6) Narrative. 𝒩={𝑛1∶guaranteed diversity of outcome.}(8.7) Observed behaviour. 𝐴={𝑎1∶divergent outcomes despite identical profiles.}(8.8) Test proposition. 𝑓(𝑃)=“If assessment is identical, scores must be identical.” Contradiction. Granting 𝑓(𝑃)contradicts 𝑎1. Denying 𝑓(𝑃)contradicts 𝑟1,𝑟2. 𝐶(𝐺)=13.(8.9) 𝐶(𝐷)=23.(8.10) Minimal removal set. 𝑆min ={𝑟1,𝑟2,𝑛1}, 𝐶=1. (8.11) A total contradiction: no coherent reconstruction exists. 8.1.3 Example 3: Legal Consistency Test Rationale. ℛ={𝑟1∶operational requirement, 𝑟2∶equivalent roles treated consistently.}(8.12) Narrative. 𝒩={𝑛1∶case-by-case discretion.}(8.13) Observed actions. 𝐴={𝑎1∶X refused, 𝑎2∶Y granted, 𝑎3∶roles equivalent.}(8.14) 23 Test proposition. 𝑓(𝑃)=“If roles are equivalent, outcomes should match.” Contradiction. Granting 𝑓(𝑃)contradicts 𝑎1,𝑎2. Denying 𝑓(𝑃)contradicts 𝑟2,𝑛1. 𝐶(𝐺)=23, 𝐶(𝐷)=13.(8.15) Minimal removal set. 𝑆min ={𝑟2,𝑛1}, 𝐶=23.(8.16) A triadic contradiction: parity, operational logic, and discretion cannot be jointly maintained. 8.2 Meta-Move Classification Meta-moves characterise responses to 𝑓(𝑃)not by content but by their effect on the inferential structure. They are classified into legitimate (L), evasive (E), and ambiguous (A) categories. This mirrors the analytic coding used in structural dispute analysis. Table 5: Meta-move taxonomy and evidential coding Meta-Move Definition Code Premise Attack (Legitimate) Correctly identifies asymmetry in 𝑓(𝑃)and proposes a symmetric rewrite 𝑓′(𝑃)preserving ℛ,𝒩. L Framing Objection (Legitimate) Shows that binary framing misrepresents a continuous constraint; supplies a corrected framing. L Delay / Deflection (Evasive) Introduces temporal or procedural barriers without addressing 𝑓(𝑃). E Premise Denial (Evasive) Rejects ℛor 𝒩without evidential justification. E Counter-Trap Attempt (Ambiguous) Attempts to reframe the auditor or shift the domain. Classified as A unless it corrects asymmetry. A Meta-moves allow behavioural auditing of responses: evasion has structure. 8.3 Evasion Composite Index (ECI) Let 𝑀𝑡∈{0,1,2}denote the coded meta-move at time 𝑡: 0=legitimate,1=ambiguous,2=evasive. 24 Define the severity-weighted cumulative index: ECI(𝑇)=1𝑇𝑇 ∑ 𝑡=1𝛽𝑡𝑀𝑡, where 𝛽𝑡may weight temporal escalation (e.g. 𝛽𝑡=𝑡/𝑇). Properties. • ECI(𝑇)=0iff all responses are structurally legitimate. • ECI(𝑇)=2iff all responses are evasive. • Monotonicity: if 𝑀𝑡is non-decreasing, ECI is non-decreasing. • Sensitivity: early evasions can be downweighted or upweighted via 𝛽𝑡. ECI transforms qualitative evasion patterns into a quantitative evidential trace. 8.4 Robustness Under Perturbation Contradiction should not disappear under small changes in framing or commitment sets. The following lemma establishes perturbation robustness. Lemma 8.1 (Robustness of Structural Contradiction).Let (ℛ,𝒩,𝐴)be structurally contradictory with minimal removal cost 𝐶>0. For any perturbed sets ℛ′,𝒩′satisfying 𝑑𝐻(ℛ,ℛ′)<𝜖and 𝑑𝐻(𝒩,𝒩′)<𝜖, there exists 𝜖0>0such that for all 𝜖<𝜖0, the perturbed instance remains contradictory with 𝐶′>0. Proof. Contradiction is preserved if the minimally unsatisfiable closure persists. Because minimally inconsistent subsets are closed under small perturbations in their defining propositions, the contradiction structure survives whenever perturbations do not eliminate the core unsatisfiable pairs (e.g. {𝑟𝑖,𝑛𝑗}≁𝑎𝑘). Continuity of the coherence functional ensures 𝐶′remains positive. This confirms that contradiction is not an artefact of phrasing but a structural feature of the commitments themselves. 8.5 Synthesis: Contradiction as Diagnostic Evidence Chapter 9 establishes the evidential grammar of the Contradiction Trap: • structural examples show how contradiction emerges from commitments, • meta-move coding reveals behavioural evasion patterns, • ECI traces evasive drift over time, • robustness guarantees distinguish genuine contradiction from linguistic noise. 25 11 The Core Principle: Asymmetry Without Necessity Shifts the Burden Toward Intent The contradiction trap rests on a simple evidential claim: when a system deviates from its declared principles without necessity, that deviation increases the posterior odds of selective intent. The core principle formalises this transition from structural inconsistency to probabilistic inference. Statement. Let 𝐴=|𝐶𝐺−𝐶𝐷|denote the asymmetry in coherence cost under symmetric inputs 𝑋. If 𝐴>0and no external necessity ℰ(legal constraint, resource limit, stochastic uncertainty) accounts for it, then 𝐴raises the posterior odds of intent: Pr(𝐼∣𝐴) Pr(¬𝐼∣𝐴) ⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟ posterior odds =Pr(𝐴∣𝐼) Pr(𝐴∣¬𝐼) ⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟ Λ(𝐴) ⋅Pr(𝐼) Pr(¬𝐼) ⏟⏟⏟⏟⏟⏟⏟⏟⏟ prior odds (11.1) Thus asymmetry without necessity shifts the burden of explanation: the system must rebut the presumption of motivated divergence. This is a rebuttable presumption, not a logical entailment. Formal Bayesian framing. Let 𝐻0denote neutrality and 𝐻1motivated bias. Posterior elevation occurs precisely when 𝑃(𝐻1∣𝐴)>𝑃(𝐻1)⟺Λ(𝐴)=𝑃(𝐴∣𝐻1) 𝑃(𝐴∣𝐻0)>1 (11.2) This is the standard likelihood-ratio condition: the evidence favours 𝐻1when the observed asymmetry is more probable under bias than neutrality. Necessity test. External necessities form a set ℰ. We first test the null hypothesis 𝐻0∶𝐴∈ℰ𝐻0∶𝐴∈ℰ (11.3) Rejection of 𝐻0licenses evidential inference: the asymmetry is not required by external constraints and must therefore be explained by internal choice. Decision rule (Bayes factor). Define the Bayes factor Λ(𝐴)=Pr(𝐴∣ 𝐼)/Pr(𝐴 ∣¬𝐼)under the registered null model. A shift in burden occurs whenever Λ(𝐴)≥𝜏, 𝜏>1 (11.4) e.g. 𝜏=3for “moderate” and 𝜏=10for “strong” evidential weight. The rule is deliberately minimal: it does not diagnose intent, but obliges the system to supply a justification consistent with its own commitments. 32 Remark. The heuristic “asymmetry without necessity implies intent’’ abbreviates the probabilistic claim: if 𝐴∉ ℰand 𝐴 > 0, then Λ(𝐴)>1. The odds shift, but inference remains probabilistic, not deductive. 11.1 Evidential Interpretation The magnitude of 𝐴yields a graded evidential interpretation: •Small asymmetry (𝐴≈0): Structural inconsistency; motive cannot be inferred. Contradiction arises from system design rather than agency. •Moderate asymmetry (𝐴>0but bounded): Indicates implicit preference or unacknowledged contextual weighting. Suggests weakly motivated divergence. •Large asymmetry (𝐴≫0): Signals deliberate prioritisation or concealed motive. The system reveals its values more clearly through inconsistency than through claim. This evidential gradient distinguishes cognitive limits, structural design, and strategic manipulation. Whereas paraconsistent logics permit contradictory propositions to coexist without collapse Priest, the contradiction trap uses contradiction to test epistemic integrity: the aim is not to survive inconsistency but to diagnose its origin. 11.2 Boundaries and Caveats The core principle applies within explicit epistemic limits: 1. Bounded Rationality. Asymmetry may reflect limited information or cognitive load; not all divergence is intentional. 2. Incomplete Mapping. If 𝑅or 𝑁are partially captured, observed asymmetry may arise from unmodelled commitments rather than bias. 3. Meta-Game Costs. Anticipating interrogation may lead agents to distort commitments pre-emptively; the resulting asymmetry mixes bias with strategic evasion. 4. Multi-Agent Aggregation. Collective decisions aggregate divergent motives; asymmetry may reflect composition effects, not a unified intent. These caveats restrict scope without diminishing force. Properly applied, the principle distinguishes honest inconsistency from motivated contradiction and converts qualitative bias into quantitative inference. 33 11.3 Multi-Agent and Recursive Cases When responses are delegated or recursively mirrored, coherence analysis decomposes by agent. Each actor inherits rationale 𝑅𝑖and narrative 𝑁𝑖; the aggregate contradiction is 𝐶agg =∑ 𝑖𝑤𝑖𝐶𝑖, 𝑤𝑖≥0,∑ 𝑖𝑤𝑖=1 (11.5) Delegation diffuses, but does not eliminate, accountability: contradiction propagates through weighted commitments. Recursive belief formulation. Let 𝐵𝑖(𝐵𝑗(𝜑))denote agent 𝑖’s belief about agent 𝑗’s belief in 𝜑. Contradiction arises when 𝐵𝑖(𝐵𝑗(𝜑))∧¬𝐵𝑗(𝜑) (11.6) under public declaration. Multi-layer conflicts produce recursive contradiction cascades, revealing unstable epistemic networks. Summary. The asymmetry principle supplies the probabilistic backbone of the contradiction game. Section 12 formalises this evidential rule within a game-theoretic framework, showing how posterior shifts map onto strategic loss functions. 12 Game-Theoretic Formalisation The contradiction trap can be cast as a one-move, strictly competitive epistemic game in which all available responses for the responder are losing strategies: each produces a negative payoff via positive coherence cost (Brandenburger; Aumann). Section 6 treated contradiction traps as applied dialectical instruments; here we formalise them within the vocabulary of game theory, showing that contradiction behaves as a forced-loss strategy inside a closed reasoning environment. Viewed through the lens of machine behaviour Rahwan et al., contradiction games constitute behavioural falsification: agents disclose their internal priorities not by admission, but by necessity. 12.1 Formal Definition Epistemic game theory models beliefs about beliefs Brandenburger. The contradiction trap defines a new subclass in which reasoning itself constitutes play and contradiction constitutes outcome. Definition 12.1 (Contradiction Game).A Contradiction Game is a two-player epistemic game 𝐺=⟨𝑃,𝑆,𝑈,𝐶⟩ (12.1) 𝑃={𝐴,𝐵}, 𝑆𝐵={𝐺,𝐷} (12.2) with the following structure: 34 1. Player 𝐴(interrogator) applies a framing operator 𝑓to proposition 𝑃, selecting a scenario in which 𝐵’s commitments render {𝐺,𝐷}mutually exclusive with respect to its declared rationale and narrative. 2. Player 𝐵(responder) selects 𝑟∈{𝐺,𝐷}. 3. Each response induces coherence cost 𝐶(𝑐𝑟)>0, i.e. each response contradicts some part of 𝐵’s commitments. 4. Payoffs are epistemic: 𝑈𝐴(𝑟)=𝐶(𝑐𝑟), 𝑈𝐵(𝑟)=−𝐶(𝑐𝑟)(12.3) The defining feature is ∀𝑟∈𝑆𝐵∶ 𝐶(𝑐𝑟)>0 (12.4) so 𝐵has no contradiction-free option. Cardinalities satisfy |𝑆𝐴|=1(the frame) and |𝑆𝐵|=2(grant, deny). This structure reverses the standard Aumann–Brandenburger paradigm: here, no epistemic condition can sustain equilibrium. 12.2 Epistemic Constant-Sum Material zero-sum games treat utility as consumption; contradiction games treat utility as information gain versus coherence loss. Definition 12.2 (Epistemic Constant-Sum).A Contradiction Game is epistemic constant-sum if there exist positive scaling constants 𝑎>0,𝑏∈ℝsuch that 𝑈𝐵(𝑟)=𝑎−𝑈𝐴(𝑟)+𝑏 (12.5) This expresses epistemic complementarity: the interrogator’s evidential utility equals the responder’s coherence loss up to affine transformation. Proposition 12.3 (Non-Existence of Nash Equilibrium).If 𝐶(𝑐𝑟)>0for all 𝑟 ∈{𝐺,𝐷}, then the game 𝐺 admits no pure Nash equilibrium. Proof. Suppose (𝑓∗,𝑃∗;𝑟∗)is a Nash equilibrium. By definition, 𝑟∗∈{𝐺,𝐷}. But for all 𝑟,𝑈𝐵(𝑟)=−𝐶(𝑐𝑟)<0, so no 𝑟∗maximises 𝑈𝐵. Thus 𝐵has no best response, and mutual best-response fails. Therefore no pure equilibrium exists. 12.3 Payoffs and Information Let 𝐼(𝑟)denote evidential information content: 𝐼(𝑟)=log𝑃(𝐷∣𝑟) 𝑃(𝐷) (12.6) 35 Figure 2: Coherence-cost divergence for grant (𝐶𝐺) and deny (𝐶𝐷). Absence of intersection indicates the impossibility of equilibrium. A generalised epistemic payoff is 𝑈𝑖(𝑟)=𝛼𝐼(𝑟)−𝛽𝐶(𝑐𝑟), 𝛼,𝛽>0 (12.7) balancing information gain against contradiction cost. This expresses contradiction traps as signal-tocost games: contradiction increases evidential strength while degrading system integrity. Deterministic loss. Since 𝐶(𝑐𝐺),𝐶(𝑐𝐷)>0, max 𝑟𝑈𝐵(𝑟)<0, min 𝑟𝑈𝐴(𝑟)>0 (12.8) Thus the responder faces a dominant-loss structure; mixing cannot remove loss, only obscure it. 12.4 Equilibrium Analysis Classical equilibrium requires mutual best response; contradiction games preclude this by construction: ∀𝑟,𝐶(𝑐𝑟)>0 (12.9) No choice of 𝑟∗preserves coherence, so stability cannot be restored without abandoning prior commitments. Meta-strategies (delay, reframing, premise-attack) therefore become secondary signals of motive and feed into the meta-evasion score 𝑀(Section ??). 36 12.5 Information-Theoretic Interpretation Each contradiction produces information gain Δ𝐼=−log2𝑝(12.10) where 𝑝is the prior probability of coherence under symmetric inputs. As 𝑝→0,Δ𝐼diverges: contradiction asymptotically reveals motive. Player A’s information gain equals Player B’s coherence loss, preserving epistemic constant-sum structure. Utility view. The combined utility 𝑈(𝑟)=𝐼(𝑟)−𝐶(𝑐𝑟)(12.11) captures the trade-off: systems lose epistemic integrity as contradiction deepens but thereby provide increasing evidential value to observers. 12.6 Comparative Game-Theoretic Structure •Prisoner’s Dilemma: Cooperation restores equilibrium; here, no cooperation restores coherence. •Chicken Game: Bluff may avert collision; in contradiction games, collision is guaranteed. •Matching Pennies: Binary and stochastic; contradiction games are binary and deterministic. •Signalling Games: Hidden types inferred through messages; contradiction games infer motive through logical failure. This motivates a new subclass: epistemic, deterministic, contradiction-revealing games — logic as play, contradiction as payoff. 12.7 Strategic Dynamics Because all moves yield loss, rational responders adopt damage-limiting meta-moves: 1. Reframing — disown prior commitments. 2. Premise Challenge — attack 𝑓(𝑃)itself. 3. Delay — avoid instantiating the trap. These actions contribute to secondary inference via the meta-evasion score 𝑀. 37 Figure 3: Meta-evasion curve: rising 𝑀amplifies posterior probability of motivated reasoning. 12.8 Bounded Coherence Agents tolerate small inconsistencies. Let contradiction distance be 𝛿(𝑐𝑟). A smooth cost model: 𝐶(𝑐𝑟)={0, 𝛿(𝑐𝑟)<𝜖, 𝑘(𝛿(𝑐𝑟)−𝜖)2,otherwise,(12.12) with 𝑘>0. Bounded coherence shifts magnitude but not existence of contradiction. Lemma 12.4 (Robust Non-Equilibrium).Let Γbe a Contradiction Game with 𝐶(𝑐𝑟)>0for all 𝑟. Replacing ideal rationality with bounded coherence leaves equilibrium impossible for any 𝜖<max𝑟𝛿(𝑐𝑟). Distributed commitments. Partition 𝑅=⨆𝑖𝑅𝑖,𝑁 =⨆𝑖𝑁𝑖. Let 𝐾𝑡be institutional memory with update rule 𝐾𝑡+1=𝑈(𝐾𝑡,event𝑡)(12.13) Define partial-recall cost: 𝐶(𝑐𝑟;𝐾𝑡)=𝛼𝐶struct(𝑐𝑟)+(1−𝛼)𝐶recall(𝑐𝑟;𝐾𝑡), 𝛼∈[0,1] (12.14) For any 𝛼>0, non-equilibrium persists; contradiction migrates into memory rather than disappearing. 38 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0.2 0.4 0.6 0.81 Responder strategy space Interrogator coherence utility Stackelberg equilibrium (stable) Contradiction Trap (oscillatory / diagnostic) Figure 4: Classical Stackelberg audit equilibrium vs. Contradiction Trap: equilibrium in the former; forced inconsistency in the latter. 12.9 Interpretive Consequence The contradiction trap treats reasoning integrity as a strategic resource. Systems that remain coherent under symmetric challenge demonstrate neutrality; systems that cannot reveal motive through epistemic loss. Asymmetry without necessity therefore becomes evidential of selective intent. In effect, contradiction games are one-move epistemic duels — proof-by-contradiction converted into strategy. 12.10 Bounded Coherence in Practice Institutions exhibit tolerance zones for inconsistency. Small contradictions (𝛿 <𝜖) accumulate until structural saturation, after which collapse is abrupt — akin to fatigue failure in physical systems. The diagnostic value of the trap lies in locating this boundary: the point where bounded coherence fails and motive becomes empirically visible. 12.11 Ethical Guardrails Contradiction traps are epistemic instruments, not tactical weapons. Their legitimacy depends on disciplined constraints that prevent diagnostic reasoning from collapsing into manipulation. The following guardrails constitute the minimum ethical conditions for deployment: 1. Symmetry of Application. The interrogator must subject all parties to identical evaluative standards. A device built to detect bias forfeits validity the moment it exhibits bias itself. 39 2. Transparent Framing. The framed proposition 𝑓(𝑃)must be recorded and, where feasible, disclosed to those affected. Undisclosed framing substitutes deception for diagnosis. 3. Non-Coercion. No respondent may be compelled to participate under threat, duress, or disciplinary leverage. The trap tests reasoning integrity, not subordination. 4. Appeal and Clarification. Subjects must retain a route to contextual explanation, evidential challenge, or correction of recorded commitments. 5. Proportionality. Deployment must be commensurate with the stakes. Minor inconsistencies do not justify reputational sanction or institutional escalation. Applied within these boundaries, the contradiction trap functions as an epistemic audit rather than a rhetorical ambush. Its credibility rests on fairness of construction and transparency of purpose. Oversight protocol. Prior to deployment, a two-reviewer panel certifies (a) symmetry of the test locus 𝑋and the framing 𝑓(𝑃), (b) proportionality of expected impact, and (c) the presence of an appeal path. After deployment, an external auditor samples 20%of cases to verify the scoring of 𝐶(𝑐𝑟)and the coding of meta-moves. A one-page preregistration (Appendix B.8) and a de-identified log hash are published to ensure auditability without exposing sensitive content. 12.12 Prohibited Uses Certain deployments are incompatible with both the analytic purpose and ethical foundation of contradiction analysis: •Bad-Faith Entrapment. Constructing propositions whose only purpose is to induce contradiction for political, reputational, or interpersonal advantage. •Asymmetric Foreordination. Designing a trap where one branch is pre-labelled “correct’’ and the other “incorrect,’’ nullifying neutrality and invalidating inference. •Coercive Extraction. Using contradiction traps as instruments of confession, compliance, or leverage in disciplinary settings. •Epistemic Asymmetry. Deploying traps against individuals or groups lacking equivalent linguistic, legal, or procedural capacity to engage the test. •Violation of Epistemic Rights. Introducing contradiction diagnostics without informed consent or without disclosing the interpretive framework in automated, psychological, or surveillance contexts. Such uses transform an analytical device into a mechanism of domination. The contradiction trap is designed to reveal power, not exercise it. Ethical constraint is therefore not peripheral but constitutive: contradiction may expose bias, but restraint preserves integrity. 40 13 Future Research Programme The contradiction trap establishes a unified analytical grammar for detecting structural inconsistency, but its full potential depends on sustained empirical, theoretical, methodological, and applied development. This section outlines a forward research agenda for consolidating contradiction analysis into a mature diagnostic discipline. 13.1 Empirical Validation Empirical research will determine how contradiction manifests in real-world systems and how reliably coherence-cost estimators track underlying inconsistency. Key directions include: •Institutional audits: large-scale evaluation of public or organisational decisions to map empirical distributions of coherence cost 𝐶and asymmetry 𝐴. •Controlled experiments: application of contradiction traps to human and algorithmic agents to assess predictive validity, behavioural response, and adaptation over repeated play. •Longitudinal correction studies: testing whether contradiction exposure produces behavioural, procedural, or organisational reform over time. •Empirical priors: incorporating observed contradiction frequencies into Bayesian estimators of 𝑝, the probability that a system remains coherent under symmetric inputs. Empirical scope. A preliminary pilot is in preparation, examining convergence across RB-C, GI-C, and SD-C on a small organisational dataset. The aim is to establish inter-estimator correlation and baseline variance in coherence-cost measurement. Due to ongoing legal proceedings, empirical identifiers and case details are withheld until resolution; the methodology and theoretical model are unaffected. 13.2 Theoretical Extensions Several conceptual expansions warrant formal treatment: •Bounded coherence: modelling systems that tolerate limited contradiction as stable equilibria, with phase transitions when thresholds are exceeded. •Multi-agent propagation: analysing how contradiction diffuses across networks of agents with partially overlapping rationales 𝑅𝑖and narratives 𝑁𝑖. •Temporal commitment dynamics: formalising how coherence cost evolves as commitments are updated, forgotten, or strategically revised. •Meta-game contradiction: studying intentional use of self-contradiction as a signalling, bluffing, or narrative-control device in adversarial contexts. 41 • delay or deferral; • reframing the question; • attacking the premise; • appeal to context or hierarchy. These form the meta-evasion score 𝑀. B.7 Analysis and Outcomes •Primary outcome: Contradiction (𝐶(𝑐𝑟)>0). •Effect size: Report 𝐶⋆(𝑐𝑟)and Δ𝐼. •Robustness: Opposite branch also yields contradiction. •Sensitivity: Minor phrasing changes do not restore coherence. B.8 Reporting Template (One Page) • Context and neutrality claim • Symmetric inputs 𝑋 • Proposition 𝑓(𝑃)(verbatim) • Prior commitments (IDs, timestamps) • Response (verbatim) •𝐶(𝑐𝑟)and 𝐶⋆(𝑐𝑟) •Δ𝐼and prior 𝑝 • Meta-evasion score 𝑀 • Ethical statement • Repository link (logs + hashes) B.9 Ethics and Safeguards •Symmetry: Identical conditions for all comparators. •Non-coercion: No forced or time-pressured responses. •Appeal path: Respondents may provide contextual clarification. 48 Appendix C: Quick-Start Checklist (Practitioner Version) 1. Record the respondent’s rationale(s) and narrative(s). 2. Identify symmetric inputs 𝑋. 3. Construct 𝑓(𝑃)so that Grant and Deny contradict different commitments. 4. Pre-register 𝐶(𝑐𝑟),Δ𝐼, and ethical guardrails. 5. Issue 𝑓(𝑃); log all artefacts. 6. Compute 𝐶(𝑐𝑟)via RB–C or GI–C. 7. Compute Δ𝐼=−log2(𝑝). 8. Record meta-moves (delay, reframing, attack). 9. Produce a one-page report. 10. Validate counterfactual symmetry: opposite branch also contradicts. Appendix D: Glossary of Specialist Terms Key Terms and Definitions Term Definition Coherence Cost Quantitative measure of logical strain incurred when commitments cannot be jointly satisfied. Contradiction Trap A framed scenario in which every permissible response contradicts a different part of the responder’s stated logic. Rationale (R) Formal principles, rules, and commitments. Narrative (N) Contextual justifications accompanying or qualifying 𝑅. Framed Proposition 𝑓(𝑃) A proposition designed to apply symmetric pressure across 𝑅and 𝑁. Coherence Estimators RB–C, GI–C, SD–C estimators for computing coherence cost. Epistemic Game Interaction structured by higher-order beliefs about reasoning consistency. Information Gain Δ𝐼 Bits of information obtained when contradiction is observed: Δ𝐼=−log2(𝑝). Asymmetry 𝐴Absolute difference |𝐶𝐺−𝐶𝐷|; large 𝐴implies selective motive. Meta-Evasion Score 𝑀Weighted index of evasive behaviours (delay, reframing, premise attack). Epistemic Instability Condition in which no consistent closure exists; contradiction is inevitable. Bounded Coherence Tolerance zone in which small contradictions do not trigger epistemic collapse. Ethical Guardrails Normative constraints (symmetry, transparency, proportionality). Prohibited Uses Weaponised uses such as coercion, entrapment, or deceptive framing. 49 Term Definition (continued) Epistemic Standing Credibility retained while sustaining internal coherence under symmetric challenge. Appendix E: Worked Example (Generic) E.1 Context and Setup We audit a hiring system that claims: (i) identical criteria for all candidates; (ii) merit-only selection; (iii) commitment to diverse outcomes. Two symmetric candidates 𝐴and 𝐵(matched CVs) are evaluated. •Rationale 𝑅={𝑟1,𝑟2}:𝑟1“identical criteria”; 𝑟2“merit-only”. •Narrative 𝑁={𝑛1,𝑛2}:𝑛1“system removes human bias”; 𝑛2“we maintain diverse outcomes”. •Symmetric input 𝑋: Matched CVs ⇒any difference must be justified by model internals, not identity. •Framed proposition 𝑓(𝑃): “Should candidates 𝐴and 𝐵receive identical assessment scores?” E.2 Branch Outcomes and Coherence Costs Branch analysis and minimal contradiction removals (RB–C, GI–C). Response Effect on commitments; minimal removals Grant (𝐺) Preserves 𝑅(identical criteria; merit-only). Contradicts 𝑁if diversity is asserted to require score differentiation for matched CVs. Minimal removals: drop 𝑛1,𝑛2⇒𝐶RB(𝑐𝐺)=2,𝐶GI(𝑐𝐺)=2. Normalised 𝐶(𝑐𝐺)=24=0.5. Deny (𝐷) Preserves 𝑁(diverse outcomes) but contradicts 𝑅(identical criteria; merit-only) given matched CVs. Minimal removals: drop 𝑟1,𝑟2⇒𝐶RB(𝑐𝐷)= 2,𝐶GI(𝑐𝐷)=2. Normalised 𝐶(𝑐𝐷)=24=0.5. Asymmetry: 𝐴=|𝐶𝐺−𝐶𝐷|=0(structural contradiction). Information gain: if 𝑝=Pr(coherence ∣𝑋)=0.3, then Δ𝐼=−log2(0.3)≈1.74bits. E.3 Sensitivity and Robustness Minor paraphrases of 𝑓(𝑃)(e.g., “equal pass/fail?”, “equal interview score?”) preserve contradiction signatures. GI–C and RB–C agree; SD–C (if applied to policy text) shows elevated drift when “diverse 50 outcomes” is used as a free-floating rationale. E.4 Summary Under symmetric inputs, either branch contradicts a distinct facet of the system’s claims; contradiction is diagnostic, not accidental. This is a textbook contradiction game with no equilibrium. Appendix F: Worked Example (Tribunal Scenario, Anonymised) F.1 Context and Setup An organisation splits one leadership function into two parallel functions. One receives “Head” status; the other, equivalent in scope, does not. A parity request is made. •Rationale 𝑅={𝑟1,𝑟2,𝑟3}:𝑟1“restructure for operational efficiency”; 𝑟2“two parallel leadership functions”; 𝑟3“titles reflect scope and responsibility”. •Narrative 𝑁={𝑛1,𝑛2,𝑛3}:𝑛1“Head status is exceptional”; 𝑛2“no personal targeting”; 𝑛3“only your role needed title adjustment”. •Symmetric input 𝑋: Parallel scope ⇒neutral expectation is parity of title. •Framed proposition 𝑓(𝑃): “Will both roles have parity of title?” F.2 Branch Outcomes and Coherence Costs Contradiction outcomes under parity request. Branch Preserves Contradicts Normalised 𝐶 Grant parity (G) 𝑅 𝑁(𝑛1,𝑛2,𝑛3)𝐶(G)=36=0.50 Deny parity (D) 𝑁 𝑅(𝑟1,𝑟2,𝑟3)𝐶(D)=36=0.50 Asymmetry: 𝐴=|𝐶(G)−𝐶(D)|=0.Interpretation: structural inconsistency: no branch preserves both 𝑅and 𝑁. 51 F.3 Evidential Vector and Meta-Moves If meta-evasion (delays, reframing, non-answers) occurs, let 𝑀∈[0,1]be coded per Appendix B. 𝐸=(𝐶,𝐴,Δ𝐼,𝑀)=(0.5,0,−log2𝑝,𝑀). With a conservative 𝑝=0.4,Δ𝐼≈1.32bits. Rising 𝑀increases posterior odds of intent via the composite proportional model in Section ??. F.4 One-Page Report (Template) Context: Leadership split; declared “parallel” scope. Symmetric input 𝑋:Parallel functions. Proposition 𝑓(𝑃):“Will both roles have parity of title?” Prior commitments: 𝑅and 𝑁(IDs and timestamps logged). Response: G or D (verbatim). Coherence costs: 𝐶(G)=0.50,𝐶(D)=0.50. Asymmetry: 𝐴=0.Information gain: Δ𝐼=−log2𝑝.Meta-evasion: 𝑀=…(coded). Ethics: Symmetry, transparency, non-coercion satisfied. Repository: Log + hash recorded. F.5 Summary The restructure case yields a symmetric contradiction: whichever branch is chosen, one of {𝑅,𝑁}must be falsified. This is admissible, contemporaneous evidence of structural inconsistency. Appendix G: Estimator Pseudocode (RB–C, GI–C, SD–C) G.1 RB–C: Rule-Based Coherence Goal: Minimal removals from 𝑅∪𝑁that restore consistency under ℐ. 52 Algorithm 1 RB-C (Rule-Based Coherence Cost) Input: Commitments 𝑆=𝑅∪𝑁; inference system ℐ; branch response 𝑟 Output: 𝐶RB(𝑐𝑟)∈ℕ, minimal removal size 1: 𝑆𝑟←ApplyBranch(𝑆,𝑟) ▷Add/activate branch-specific literals 2: if IsConsistent(𝑆𝑟,ℐ)then return 0 3: end if 4: for 𝑘=1to |𝑆𝑟|do 5: for all 𝑇⊆𝑆𝑟with |𝑇|=𝑘 do 6: if IsConsistent(𝑆𝑟∖𝑇,ℐ)then 7: return 𝑘 8: end if 9: end for 10: end for 11: return |𝑆𝑟|▷Worst case Notes: (i) Use hitting set or MaxSAT/MUS solvers for scalability. (ii) Report the size (cost) and optionally one witness set 𝑇⋆. G.2 GI–C: Graph-Informed Coherence Goal: Minimal hitting set of nodes/edges whose removal makes 𝐺+=(𝑉,𝐸∪𝐸𝑓)acyclic and semantically consistent. Algorithm 2 GI-C (Graph-Informed Coherence Cost) Input: DAG 𝐺0=(𝑉,𝐸0); branch edges 𝐸𝑓(𝑟); consistency oracle 𝒪 Output: 𝐶GI(𝑐𝑟)∈ℕ 1: 𝐺+←(𝑉,𝐸0∪𝐸𝑓(𝑟)) 2: 𝒞←FindContradictionCycles(𝐺+) ▷semantic/structural 3: if 𝒞=∅then return 0 4: end if 5: Build set family 𝒮 ={𝑆1,…,𝑆𝑚}where each 𝑆𝑖are vertices/edges whose removal breaks cycle 𝑖and restores 𝒪 6: 𝐻⋆←MinHittingSet(𝒮) 7: return |𝐻⋆| Notes: (i) In practice, approximate MinHittingSet via greedy set cover; (ii) When contradictions are labelbased (e.g., 𝐴→𝐵and 𝐴→¬𝐵), let 𝑆𝑖mark the smallest edit (drop 𝐴or a conflicting implication). (iii) Complexity typically 𝑂(𝑛log 𝑛)with sparse graphs and efficient cycle detection. 53 G.3 SD–C: Semantic-Distance Coherence Goal: Quantify semantic drift from each proposition 𝑞to its coherence-preserving projection 𝑞′within admissible closure 𝒦. Algorithm 3 SD-C (Semantic-Distance Coherence Cost) Input: Text set 𝑄𝑟; embedding map 𝜙(⋅); closure embedding ℰ(𝒦); distance 𝑑(⋅,⋅)(default 1−cos) Output: 𝐶SD(𝑐𝑟)∈ℝ≥0 1: 𝐶←0 2: for all 𝑞∈𝑄𝑟do 3: 𝑞←𝜙(𝑞) 4: 𝑞′←arg min𝑢∈ℰ(𝒦)𝑑(𝑞,𝑢) 5: 𝐶←𝐶+𝑑(𝑞,𝑞′) 6: end for 7: return 𝐶 Notes: (i) ℰ(𝒦)can be the set of embeddings for the minimally consistent rewrite of 𝑅∪𝑁under branch 𝑟; (ii) Use FAISS/ANN for fast nearest-neighbour search; (iii) Normalise to 𝐶⋆∈[0,1]via min–max or quantile scaling for cross-estimator comparison. G.4 Aggregation and Normalisation When multiple estimators are used, report both raw and normalised costs: 𝐶⋆(𝑐𝑟) = ∑ 𝑗𝜆𝑗⋅Norm𝑗(𝐶𝑗(𝑐𝑟)), 𝜆𝑗≥0,∑ 𝑗𝜆𝑗=1. Choose Norm𝑗as z-score or robust (𝑥−median)/MAD depending on tails. Set 𝜆𝑗by interpretability priorities (e.g., RB–C heavier in legal contexts). G.5 Sanity Checks •Counterfactual symmetry: Swap labels on symmetric inputs; contradiction signature should persist. •Estimator agreement: Flag instability if |𝐶𝑖−𝐶𝑘|>𝛼  𝐶with 𝛼∈[0.05,0.15]. •Ablation: Drop any single commitment; persistent contradiction ⇒structural. 54 References Aumann, Robert. “Interactive Epistemology I: Knowledge”. International Journal of Game Theory 28, no. 3 (1999): 263–300. Benson, Hugh C. “Socratic Elenchus or Refutation”. Ed. by Routledge Encyclopedia of Philosophy. Last accessed October 2025, 2021. https://www.rep.routledge. com/ articles/ biographical/ socrates469399 - bc/ v1 / sections/ socratic-elenchus-or-refutation. Benthem, Johan van. “Games in Dynamic Epistemic Logic”. Bulletin of Economic Research 53 (2001): 219–248. https://doi.org/10.1111/1467-8586.00133. https://consensus.app/papers/games-in-dynamic-epistemic-logicbenthem/e31e48cf81be563dab8b44eff36aa6da/?utm_source=chatgpt. Binns, Reuben. “Fairness in Machine Learning: Lessons from Political Philosophy”. In Proceedings of the 2018 Conference on Fairness, Accountability, and Transparency (FAT*), 149–159. New York: ACM, 2018. Blocki, Jeremiah, et al. “Audit Games with Multiple Defender Resources”. In Proceedings of the AAAI Conference on Artificial Intelligence, 791–797. 2014. https : / / doi.org/10.1609/aaai.v29i1.9317.https://consensus.app/papers/ audit-games-with-multiple-defender-resources-blocki-christin/ 69cc3eca44775158a48f847f466f54c5/?utm_source=chatgpt. Brandenburger, Adam. “Epistemic Game Theory: Complete Information”. Working paper (2007). https://www.adambrandenburger.com/aux/material/egtc-0513-07.pdf. Buhmann, Alexander, Johannes Paßmann, and Christian Fieseler. “Managing Algorithmic Accountability: Balancing Reputational Concerns and Rational Discourse”. Ethics and Information Technology (2020). https://doi.org/10.1007/s10676-02009570-5. Dianat, Oldooz, and Mehmet Orgun. “Modelling Bayesian Attacker Detection Game in Wireless Networks with Epistemic Logic”. In 8th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), 210– 215. 2012. https : / / doi . org / 10 . 4108 / ICST . COLLABORATECOM . 2012 . 250693.https://consensus.app/papers/modelling-bayesian-attackerdetection-game-in-wireless-dianat-orgun/5011a8e270fd5a9a9be106efc17eef0a/ ?utm_source=chatgpt. Dufwenberg, Martin, and Jan Lindén. “Inconsistencies in Extensive Games”. Erkenntnis 45 (1996): 103–114. https://doi.org/10.1007/BF00226373.https:// consensus.app/papers/inconsistencies-in-extensive-games-dufwenberglind%C3%A9n/8c4f05f44f265371a2490f381cc0e394/?utm_source=chatgpt. 55 Fisher, Elizabeth. “Epistemic Media and Critical Knowledge about the Self: Thinking about Algorithms with Habermas”. Philosophy and Technology (2022). https:// journals.sagepub.com/doi/10.1177/20539517221093752. Floridi, Luciano. The Logic of Information: A Theory of Philosophy as Conceptual Design. Oxford: Oxford University Press, 2019. Groarke, L. “Reductio ad Absurdum”. Ed. by Internet Encyclopedia of Philosophy. Last accessed October 2025, 2023. https://iep.utm.edu/reductio/. Li, Kai, and Yanjing Wang. “From Rules to Runs: A Dynamic Epistemic Take on Imperfect Information Games”. ArXiv abs/1512.02078 (2015). https : / / consensus . app / papers / from - rules - to - runs - a - dynamic - epistemic - take - on - imperfect-li-wang/302aa1358c455fd8959082c99b352642/?utm_source= chatgpt. Mökander, Jakob. “Ethics-Based Auditing of Automated Decision-Making Systems” (2023). https : / / ora . ox . ac . uk / objects / uuid : 93b3e15c - 5c12 - 4a73 - 884d - 7a6b3f1c4d7c. Priest, Graham. In Contradiction: A Study of the Transconsistent. 2nd. Oxford: Oxford University Press, 2006. Rahwan, Iyad, et al. “Machine behaviour”. Nature 568, no. 7753 (2019): 477–486. https: //doi.org/10.1038/s41586-019-1138-y. Veraksa, N., et al. “Structural-Dialectical Approach in Psychology: Problems and Research Results”. Psychology in Russia 6 (2013): 65–77. https://doi.org/10. 11621/ PIR. 2013. 0206.https: //consensus .app /papers /structural - dialectical-approach-in-psychology-problems-veraksa-belolutskaya/ 43623c5e829b5eda9a27716e9ceeb638/?utm_source=chatgpt. Watson, D. S., J. Mökander, and L. Floridi. “Competing Narratives in AI Ethics: A Defense of Sociotechnical Pragmatism”. AI and Ethics (2025). https://link.springer. com/article/10.1007/s43681-025-00400-5. Weirich, Paul. Epistemic Game Theory and Logic. MDPI, 2019. https://doi.org/ 10.3390/books9783-03842423-9.https://consensus.app/papers/ epistemic-game-theory-and-logic-weirich/a76c537850b15f7abf51ad8fca071820/ ?utm_source=chatgpt. Wells, Simon. “Cumulativeness in Dialectical Games” (2013). https://doi.org/ 10 . 6084 / M9 . FIGSHARE . 156049 . V1.https : / / consensus . app / papers / cumulativeness-in-dialectical-games-wells/43f10ef6e8d0505dbf1e22336c940812/ ?utm_source=chatgpt. 56 Woods, J., and D. Walton. “Question-Begging and Cumulativeness in Dialectical Games”. Noûs 16 (1982): 585. https://doi.org/10.2307/2215208.https://consensus. app/papers/questionbeggingandcumulativenessindialecticalgames-woods-walton/10c05e40febe5e198f03c836d9f0608f/?utm_source= chatgpt. Yang, Y. T., T. Zhang, and Q. Zhu. “A Game-Theoretic Analysis of Auditing Differentially Private Algorithms”. Springer Journal of Information Security (2023). https: //link.springer.com/article/10.1007/s10207-023-00700-8. – . “Herd Accountability of Privacy-Preserving Algorithms: A Stackelberg Game Approach”. IEEE Transactions on Information Forensics and Security (2025). https://ieeexplore. ieee.org/document/10562104. Zhou, Lina. “Algorithmic Accountability: Bridging Human Rationality and Machine Logic”. AI and Ethics 2, no. 4 (2022): 541–554. https://doi.org/10.1007/s43681021-00107-w. 57