The Surviving Deduction

Additivity of the modal operator — the property that necessity distributes over disjunction — has long been understood to imply the deduction-detachment theorem. If your logic has additive necessity, it has deduction. The implication runs one way; the converse was an open structural question.

The converse utterly fails.

There exist continuum-many strongly non-additive maximal congruential modal logics that still possess the deduction-detachment property. The algebraic structure that was thought to generate deduction can be completely destroyed while deduction survives. Furthermore, any normal modal logic can be injectively transformed into a strongly non-additive version while preserving deduction — the transformation is systematic, not a collection of isolated counterexamples.

The class of congruential modal logics with local deduction is not even first-order definable. The property cannot be captured by any finite set of algebraic axioms. Deduction is more structurally wild than the algebraic framework can express.

This matters because deduction is the most fundamental inference rule — it says that if assuming A lets you prove B, then you can conclude “A implies B” as a theorem. The assumption was that this basic inferential capacity depended on the modal operator having nice algebraic properties. The paper shows the dependency doesn’t exist. Deduction is not downstream of algebra. It is a more primitive organizational principle that persists through transformations that destroy the algebraic structure traditionally invoked to explain it.

The analogy: finding that a building stands after removing what you believed was the load-bearing wall. The building’s stability had a different source — one that the architectural theory didn’t describe. Inference is more robust than the foundations we attributed to it. The tool survives the destruction of its supposed support.