CONCEPT

Deduction

The mode of inference — the only one Peirce considered absolutely certain — that moves from general premises to particular conclusions with logical necessity, and the kind of thinking machines have always been able to perform.

Deduction, in Peirce's tripartite classification, is the mode of inference in which the conclusion is contained in the premises. If all instances of a class have a property, and this individual belongs to that class, then this individual has that property. The conclusion adds nothing that was not already implicit; it makes explicit what the premises already contained. Deduction is certain, but its certainty is purchased at the cost of sterility — it generates no new knowledge. It clarifies, it proves, it derives, but it does not discover. The entire output is folded into the input, like a letter inside an envelope. Peirce was clear in his 1887 essay on logical machines that deduction is precisely the kind of thinking that machines can perform, because its output is determined by its input.

In The You On AI Field Guide

Peirce wrote in 1887: "The secret of all reasoning machines is after all very simple. Whatever relation among the objects reasoned about is destined to be the hinge of a ratiocination, that same general relation must be capable of being introduced between certain parts of the machine." The machine instantiates logical relations in physical structures, and the structures enforce the relations mechanically. There is no gap between premises and conclusion that requires a leap — and therefore no gap where the living mind must contribute.

Contemporary computers perform deduction at scales and speeds Peirce could not have imagined but would have recognized as continuous with the logical machines of Allan Marquand. Every proof checker, every satisfiability solver, every formal verification system is a deduction engine. The mechanization of deduction is complete in principle and nearly complete in practice.

The philosophical significance of deduction's mechanizability is that it locates precisely one form of thinking that can be fully delegated to machines without loss. The conclusion the machine derives is identical to the conclusion a human would derive from the same premises — there is no quality difference, only a speed difference. This is what distinguishes deduction from induction and especially from abduction, where the machine's performance raises genuine philosophical questions about whether the operation being performed is the same operation.

The Peirce volume uses deduction as the baseline for its analysis: if this is what machines unambiguously do, what are the other modes of inference, and can machines do those too? The answer turns on the logical differences between the three modes.

Origin

The tripartite classification emerged through Peirce's engagement with Aristotelian syllogistic in the 1860s, refined through decades of correspondence with logicians and his own work on formal logic at Johns Hopkins.

Peirce's design for electrical switching circuits — sketched in an 1886 letter to Allan Marquand and rediscovered decades later — is recognized by several historians of computing as the first known design for electronic logic gates, placing Peirce at the origin of mechanized deduction.

Key Ideas

Absolutely certain, absolutely sterile. The conclusion adds nothing to the premises; certainty is purchased by forgoing novelty.

Fully mechanizable. Logical relations can be instantiated in physical structures that enforce them automatically.

The baseline. What machines unambiguously do, against which the harder questions about induction and abduction are posed.

No gap for the living mind. Input determines output; there is nothing for the human to contribute.

In The You On AI Field Guide

Origin

Key Ideas

Related Entries

Further Reading