Research Note ยท Verification and Vagueness

Three-Valued Logic as a Verification Layer for Fuzzy Data

The aim is not to eliminate fuzziness, but to build a formal verification layer that remains inferentially stable when predicates are borderline, weakly grounded, or semantically underdetermined.

Three-valued logic Verification Vagueness

One of the most promising directions in current work on vagueness is not the attempt to eliminate fuzziness altogether, but to build formal systems that remain inferentially stable when predicates are borderline, weakly grounded, or semantically underdetermined. That is the core motivation of an ongoing research program around three-valued logic: not to solve higher-order vagueness once and for all, but to develop a usable verification framework for arguments, data, and results produced under fuzzy conditions.

The key starting point is a negative result. Standard degree-theoretic approaches, especially those associated with many-valued semantics, are often attractive because they track graduality. A predicate such as is red, is safe, or is clinically significant does appear to admit cases that are more or less fitting. But Edgington's criticism remains decisive: numerical truth degrees do not, in general, preserve the inferential role of statements in context. Two premises can receive the same scalar values while supporting materially different conjunctions, disjunctions, or conditionals. The problem is not merely representational. It is structural. Once generalized truth-functionality fails, verification becomes unstable.

That failure is precisely where the three-valued proposal becomes interesting. Instead of adding more granularity, it reduces the semantic space to the smallest non-bivalent extension that still tracks borderline cases. The valuation space is restricted to V = {0, 1/2, 1}, where 1 marks validated truth, 0 marks validated falsity, and 1/2 marks a genuine borderline status. The formal goal is not metaphysical completion. It is conservative extension. Classical logic should remain intact on crisp cases, while fuzzy cases receive an explicit third status rather than being forced into premature bivalence.

The resulting framework inherits standard many-valued machinery, but only in its discrete form. The novelty is not that these clauses are mathematically exotic. It is that, once restricted to three values, they recover a much stronger form of compositional discipline than dense degree semantics typically can. In other words, the framework gives up fine-grained scores in order to retain a more robust inferential architecture.

This matters for verification. In practical systems, the hard problem is rarely that we lack enough decimal points of uncertainty. The harder problem is that noisy or vague inputs are routinely converted into outputs that look more precise than the warrant allows. A three-valued verifier blocks exactly that failure mode. It lets a system distinguish between three formally meaningful states: accepted, rejected, and unresolved. That third state is not rhetorical caution. It is a semantic value with rules of propagation.

That makes the framework directly relevant to data validation and result checking in fuzzy environments. Suppose the relevant predicates are records match, sample is contaminated, model output is safe, or evidence supports claim C. In all of these settings, a binary validator is too coarse, because borderline cases are real and operationally important. But a continuous fuzzy score is often too weak as a basis for validation, because it does not guarantee inferential stability across compound claims.

The broader research program, then, is not just philosophical. It is methodological and computational. The aim is to design logics for environments in which predicates are semantically fuzzy but reasoning still needs to be audited. That includes database integrity under weak labels, AI-system evaluations under ambiguous criteria, scientific inference under noisy thresholds, and policy reasoning where legal or ethical categories are not cleanly partitioned.

The central hypothesis is that three-valued logic may supply a better validation layer than either strict bivalence or unconstrained fuzzy semantics: stronger than binary classification where the world is not binary for us, and more disciplined than dense degrees where inferential compositionality matters.

There is an obvious limitation. Three-valued logic does not defeat higher-order vagueness. Borderlines of borderlines remain. But this is not a defect in the research program; it is one of its clearest methodological commitments. The relevant benchmark is not complete metaphysical elimination of vagueness. The benchmark is whether a formal system improves validation under conditions of unavoidable fuzziness while preserving as much truth-functionality as possible. On that benchmark, three-valued logic is not a final answer. It is a credible path forward.