Strict-Tolerant Logic in Non-Classical Reasoning

• Strict-Tolerant Logic is a non-classical framework defined by a mixed preservation condition, where strict truth for premises and tolerant treatment of conclusions preserve classical validities.
• It employs a three-valued semantics based on Strong Kleene logic, offering a clear method to handle vagueness and borderline cases without resorting to a continuum of truth values.
• Extensions to intuitionistic and minimal logics reveal distinct inferential behaviors, emphasizing its metainferential nuances and robust proof-theoretic formulation.

Searching arXiv for recent and foundational papers on strict-tolerant logic and related metainferential work. Strict-Tolerant Logic is a non-classical framework in which validity is defined by a mixed preservation condition: from the truth of the premises must follow the non-falsity of the conclusion. In its standard formulation, this modifies the ordinary notion of logical consequence without abandoning classical validity at the level of extension. The framework has been developed in connection with vagueness, tolerance, and naive truth, and it has also been extended to intuitionistic and minimal settings, where its behavior is markedly sensitive to the underlying semantics. Recent work shows that strict-tolerant inference over intuitionistic semantics collapses to ordinary classical consequence, while the corresponding minimal version becomes inferentially trivial; at the metainferential level, however, classical, intuitionistic, and minimal strict-tolerant systems separate from one another (Barroso-Nascimento et al., 12 Sep 2025).

1. Core notion of strict-tolerant consequence

Let $L$ be a propositional language, and let interpretations $\mathcal I$ be equipped with a notion of truth $\mathcal I \vDash A$ and falsity $\mathcal I \vDash \neg A$. The strict-tolerant consequence relation is defined to capture the condition that “from the truth of all premises follows at least the non-falsity of the conclusion” (Barroso-Nascimento et al., 12 Sep 2025). For a set of premises $\Gamma \subseteq L$ and a set of conclusions $\Delta=\{A_1,\dots,A_n\}$, one has

$\Gamma \Rightarrow_{ST} \Delta$

iff for every interpretation $\mathcal I$, if $\mathcal I \vDash B$ for every $B\in\Gamma$, then $\mathcal I$0 for some $\mathcal I$1 (Barroso-Nascimento et al., 12 Sep 2025). In the single-succedent case,

$\mathcal I$2

A closely related three-valued presentation distinguishes strict consequence, tolerant consequence, and their mixed form. In that setting, a valuation $\mathcal I$3 takes values in $\mathcal I$4, where $\mathcal I$5 means “strictly true,” $\mathcal I$6 means “borderline,” and $\mathcal I$7 means “strictly false” (Cobreros et al., 2022). The mixed strict-tolerant relation is then

$\mathcal I$8

This formulation makes explicit the mixed character of the logic: premises are evaluated strictly, conclusions tolerantly (Cobreros et al., 2022).

In first-order multiple-conclusion form, a sequent $\mathcal I$9 is ST-satisfied by a model just in case either some premise fails to be strictly true or some conclusion is tolerantly true (Paoli et al., 27 Feb 2026). The resulting notion preserves all classically valid laws, a fact expressed by the equivalence

$\mathcal I \vDash A$0

for multiple-conclusion consequence (Paoli et al., 27 Feb 2026). This classical coincidence at the level of extension is one of the central structural features of the framework.

2. Semantics and the strict/tolerant distinction

The best-known semantic presentation of Strict-Tolerant Logic uses Strong Kleene truth-functions on the three-valued set $\mathcal I \vDash A$1 (Cobreros et al., 2022). For any formulas $\mathcal I \vDash A$2,

$\mathcal I \vDash A$3

and

$\mathcal I \vDash A$4

Quantifiers are interpreted by infimum and supremum over variants of a valuation (Cobreros et al., 2022). The same Strong Kleene basis is used in first-order ST-models, where predicates are interpreted as maps into $\mathcal I \vDash A$5 and functions in the ordinary way (Paoli et al., 27 Feb 2026).

Within this semantics, strict and tolerant statuses are sharply separated. A sentence is strictly true iff it receives value $\mathcal I \vDash A$6, tolerantly true iff it receives either $\mathcal I \vDash A$7 or $\mathcal I \vDash A$8, strictly false iff it receives $\mathcal I \vDash A$9, and tolerantly false iff it receives $\mathcal I \vDash \neg A$0 or $\mathcal I \vDash \neg A$1 (Paoli et al., 27 Feb 2026). That distinction yields three corresponding consequence relations. Strict consequence requires strict truth of premises and strict truth of conclusion; tolerant consequence requires at least borderline truth of premises and conclusion; strict-tolerant consequence combines strict premises with tolerant conclusion (Cobreros et al., 2022).

A notable consequence is that the three relations differ in how they treat borderline cases while coinciding extensionally with ordinary first-order classical entailment (Cobreros et al., 2022). This does not mean that the framework is merely notationally classical. Rather, what differs is which semantic configurations count as countermodels when premises or conclusions take the borderline value $\mathcal I \vDash \neg A$2. A plausible implication is that ST is best understood not as a rival set of theorems but as a refined account of consequence under mixed standards of premise acceptance and conclusion toleration.

3. Tolerance, vagueness, and object-language principles

Strict-Tolerant Logic has been developed as a logical framework for vagueness, especially for capturing tolerance without giving up classical validities. In the three-valued setting with a vague predicate $\mathcal I \vDash \neg A$3 and a similarity relation $\mathcal I \vDash \neg A$4, one may state the tolerance principle directly in the object language as

$\mathcal I \vDash \neg A$5

(Cobreros et al., 2022). A proof-theoretic counterpart is the metainference rule

$\mathcal I \vDash \neg A$6

which is sound in ST-models satisfying the relevant similarity constraint (Cobreros et al., 2022).

The significance of this construction lies in the claim that continuum many degrees are not required to account for tolerance phenomena. “Tolerance and degrees of truth” argues that both Smith’s fuzzy approach and the strict-tolerant approach can be subsumed under a common three-valued framework, and that three values suffice to satisfy Smith’s central desiderata, internalize the closeness principle as an object-language tolerance principle, and reproduce classical entailment in the extended language (Cobreros et al., 2022). In that account, the unique proper symmetric open parameter with only three values is

$\mathcal I \vDash \neg A$7

and its associated consequence is exactly ST-logic (Cobreros et al., 2022).

This line of work places ST at the intersection of non-classical semantics and conservative inferential behavior. The framework validates a tolerance principle while preserving a fully classical core of inference (Cobreros et al., 2022). This suggests that its primary role is not to revise theoremhood but to alter the semantic standards under which inferential legitimacy is assessed in the presence of borderline cases.

4. Extensions to intuitionistic and minimal logic

A major recent development is the systematic application of the strict-tolerant approach to intuitionistic and minimal logic (Barroso-Nascimento et al., 12 Sep 2025). In the Kripke-style setting used there, falsity of $\mathcal I \vDash \neg A$8 is defined strongly by

$\mathcal I \vDash \neg A$9

and in the intuitionistic setting one always has $\Gamma \subseteq L$0 never holds (Barroso-Nascimento et al., 12 Sep 2025).

For intuitionistic semantics, strict-tolerant consequence is defined by

$\Gamma \subseteq L$1

(Barroso-Nascimento et al., 12 Sep 2025). The key result is the collapse theorem: $\Gamma \subseteq L$2 for all $\Gamma \subseteq L$3 (Barroso-Nascimento et al., 12 Sep 2025). The proof uses a generalized Glivenko theorem: if $\Gamma \subseteq L$4, then $\Gamma \subseteq L$5, and from $\Gamma \subseteq L$6 in any intuitionistic model making all of $\Gamma \subseteq L$7 true, it follows that $\Gamma \subseteq L$8 is not false, exactly as required by the ST condition (Barroso-Nascimento et al., 12 Sep 2025). The stated corollary is that there is no novel “intuitionistic strict-tolerant” logic at the inferential level: all strict-tolerant intuitionistic inferences are already classical (Barroso-Nascimento et al., 12 Sep 2025).

For minimal logic, the situation is more extreme. Minimal strict-tolerant consequence is defined by

$\Gamma \subseteq L$9

(Barroso-Nascimento et al., 12 Sep 2025). The corresponding theorem states that no inferences are valid: $\Delta=\{A_1,\dots,A_n\}$0 for every $\Delta=\{A_1,\dots,A_n\}$1 (Barroso-Nascimento et al., 12 Sep 2025). The argument uses a trivial minimal model with a single world $\Delta=\{A_1,\dots,A_n\}$2 and $\Delta=\{A_1,\dots,A_n\}$3 for every formula $\Delta=\{A_1,\dots,A_n\}$4, including $\Delta=\{A_1,\dots,A_n\}$5; in that model, every premise is true but every conclusion is also “falsely false,” so no non-vacuous strict-tolerant inference survives (Barroso-Nascimento et al., 12 Sep 2025).

A further example clarifies why the intuitionistic collapse does not extend to minimal logic. The classical tautology $\Delta=\{A_1,\dots,A_n\}$6 satisfies $\Delta=\{A_1,\dots,A_n\}$7 but fails $\Delta=\{A_1,\dots,A_n\}$8 in a suitable two-world minimal model, exhibiting the non-Glivenko behavior of minimal logic (Barroso-Nascimento et al., 12 Sep 2025). The contrast with intuitionistic logic is thus not merely technical; it is tied to the availability of the double-negation bridge used in the intuitionistic collapse proof.

5. Metainferential strict-tolerant logics

Strict-tolerant methods can be lifted from ordinary inferences to metainferences, where premises and conclusion are themselves inferences (Barroso-Nascimento et al., 12 Sep 2025). If

$\Delta=\{A_1,\dots,A_n\}$9

then the strict-tolerant metainference relation $\Gamma \Rightarrow_{ST} \Delta$0 holds iff for every interpretation $\Gamma \Rightarrow_{ST} \Delta$1, at least one of the following occurs: for some premise-inference, $\Gamma \Rightarrow_{ST} \Delta$2 and $\Gamma \Rightarrow_{ST} \Delta$3; or the succedent’s premises fail; or the succedent’s conclusion is not false (Barroso-Nascimento et al., 12 Sep 2025). The corresponding semantic notions are

$\Gamma \Rightarrow_{ST} \Delta$4

according as the condition is evaluated over intuitionistic, minimal, or classical models (Barroso-Nascimento et al., 12 Sep 2025).

At this metainferential level, the systems do not collapse together. Although $\Gamma \Rightarrow_{ST} \Delta$5 and $\Gamma \Rightarrow_{ST} \Delta$6 is trivial, the resulting metainferential logics are distinct (Barroso-Nascimento et al., 12 Sep 2025). Two separation results are central.

First, the rule of conjunction introduction,

$\Gamma \Rightarrow_{ST} \Delta$7

is valid in $\Gamma \Rightarrow_{ST} \Delta$8 but fails in $\Gamma \Rightarrow_{ST} \Delta$9, and hence also in $\mathcal I$0 (Barroso-Nascimento et al., 12 Sep 2025). The countermodel is a Kripke frame with root $\mathcal I$1 and two immediate successors $\mathcal I$2, $\mathcal I$3, where $\mathcal I$4 holds but $\mathcal I$5 does not at $\mathcal I$6, and $\mathcal I$7 holds but $\mathcal I$8 does not at $\mathcal I$9. Then each of $\mathcal I \vDash B$0 and $\mathcal I \vDash B$1 is strictly-tolerant valid, but $\mathcal I \vDash B$2 fails at every world, so the metainference is invalid (Barroso-Nascimento et al., 12 Sep 2025).

Second, the “explosion” metainference

$\mathcal I \vDash B$3

is valid in $\mathcal I \vDash B$4 but fails in $\mathcal I \vDash B$5 (Barroso-Nascimento et al., 12 Sep 2025). In the intuitionistic setting, if both $\mathcal I \vDash B$6 and $\mathcal I \vDash B$7 are not-false, falsity of $\mathcal I \vDash B$8 follows and hence any $\mathcal I \vDash B$9 is not-false; in minimal logic, a three-world model can separate branches for $B\in\Gamma$0 and $B\in\Gamma$1 while preventing $B\in\Gamma$2 from forcing falsity uniformly, so $B\in\Gamma$3 may remain false (Barroso-Nascimento et al., 12 Sep 2025).

These results show that metainferential strict-tolerant logic preserves distinctions that are obliterated at the inferential level. A plausible implication is that the strict-tolerant transformation interacts more delicately with rule validity than with ordinary consequence, especially in constructive and paraconsistent settings.

6. Proof theory and first-order calculi

The proof theory of first-order ST exhibits a non-trivial divergence between ordinary derivability in cut-free classical sequent calculi and local metainferential ST-validity. The classical sequent calculus without Cut is only partially aligned with the latter: the relations coincide only upon the addition of elimination rules and only within the propositional fragment, due to the non-invertibility of the quantifier rules (Paoli et al., 27 Feb 2026). In the first-order case, quantifier introduction rules such as

$B\in\Gamma$4

are not invertible, so one cannot safely add quantifier eliminations in the same way (Paoli et al., 27 Feb 2026).

Two calculi have been proposed to recover full correspondence with local metainferential ST-validity in the first-order case (Paoli et al., 27 Feb 2026).

Calculus	Main device	Reported properties
$B\in\Gamma$5	Henkin expansion with witness rules and invertible quantifier rules	soundness, completeness, Cut admissible
$B\in\Gamma$6	discharge of sequent-assumptions	soundness, completeness, normalisable, interpolation

The first system, $B\in\Gamma$7, expands the language by adding Henkin constants for universal and existential formulas and uses witness-introduction, witness-elimination, and invertible quantifier rules without eigenvariable conditions (Paoli et al., 27 Feb 2026). Completeness is proved by a canonical model construction using prime, $B\in\Gamma$8-consistent Henkin theories, and the system is cut-free with admissible Cut (Paoli et al., 27 Feb 2026).

The second system, $B\in\Gamma$9, achieves invertibility by allowing rules that discharge entire sequent assumptions (Paoli et al., 27 Feb 2026). It operates with multiset sequents, includes generalized identity and contraction, and provides quantifier introduction, elimination, and discharge rules (Paoli et al., 27 Feb 2026). The calculus is normalisable: every proof can be transformed into a normal one, and it also admits interpolation, with finite interpolant sets restricted to the relation-symbols and free variables common to the relevant premises and conclusion (Paoli et al., 27 Feb 2026).

The broader significance of these results is that every local metainferential ST-valid inference among first-order sequents can be derived without postulating a non-analytic Cut rule (Paoli et al., 27 Feb 2026). This places ST within a technically robust Gentzen-style environment while preserving the mixed semantic character that motivates the logic.

7. Related uses, scope, and misconceptions

Strict-Tolerant Logic is associated in the literature with naive theories of truth and vagueness, respectively including a fully disquotational truth predicate and an unrestricted tolerance principle, without jettisoning any classically valid laws (Paoli et al., 27 Feb 2026). In the first-order setting, one can add a unary truth predicate $\mathcal I$00 together with biconditional axioms recovering $\mathcal I$01 in ST, and likewise add unrestricted tolerance principles for vague predicates; none of these extensions invalidates any classical sequent, because ST-validity coincides with classical validity (Paoli et al., 27 Feb 2026).

A common misconception is that ST introduces new valid first-order theorems in virtue of its three-valued semantics. The cited work states instead that strict, tolerant, and strict-tolerant consequence all coincide extensionally with ordinary first-order classical entailment (Cobreros et al., 2022). What changes is the treatment of borderline semantic values and, correspondingly, the space of acceptable countermodels. Another misconception is that constructive bases automatically yield new strict-tolerant object logics. Recent results show that this is false for intuitionistic logic, where the strict-tolerant relation collapses exactly to classical consequence, and also false in a different way for minimal logic, where no object-level inferences are valid at all (Barroso-Nascimento et al., 12 Sep 2025).

The phrase “strict-tolerant” also occurs in an unrelated engineering context, namely fault-tolerant coding in 3-bit Hamming space (0903.4046). There it refers to a coding scheme with poles $\mathcal I$02 and $\mathcal I$03, nearest-pole decoding, and tolerant Boolean operators that auto-correct any single-bit fault on the next gate (0903.4046). This usage is terminologically similar but conceptually distinct from strict-tolerant logical consequence. The logical literature concerns mixed truth-preservation and non-falsity-preservation; the coding literature concerns error correction in Boolean circuits.

Taken together, the cited work presents Strict-Tolerant Logic as a framework with a classical inferential profile, non-classical semantic machinery, and substantial metainferential structure. In vagueness, it provides a formal setting for tolerance without continuum-valued commitments (Cobreros et al., 2022). In constructive settings, it exhibits collapse and triviality phenomena at the object level but genuine differentiation at the metalevel (Barroso-Nascimento et al., 12 Sep 2025). In proof theory, it supports cut-free first-order calculi aligned with local metainferential validity (Paoli et al., 27 Feb 2026). These features define the contemporary research landscape of the subject.