Deduction theorem

EN Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.

In mathematical logic, a deduction theorem is a metatheorem that justifies doing conditional proofs from a hypothesis in systems that do not explicitly axiomatize that hypothesis, i.e. to prove an implication A → B {\displaystyle A\to B} , it is sufficient to assume A {\displaystyle A} as a hypothesis and then proceed to derive B {\displaystyle B} . Deduction theorems exist for both propositional logic and first-order logic. The deduction theorem is an important tool in Hilbert-style deduction systems because it permits one to write more comprehensible and usually much shorter proofs than would be possible without it. In certain other formal proof systems the same conveniency is provided by an explicit inference rule; for example natural deduction calls it implication introduction. In more detail, the propositional logic deduction theorem states that if a formula B {\displaystyle B} is deducible from a set of assumptions Δ ∪ { A } {\displaystyle \Delta \cup \{A\}} then the implication A → B {\displaystyle A\to B} is deducible from Δ {\displaystyle \Delta } ; in symbols, Δ ∪ { A } ⊢ B {\displaystyle \Delta \cup \{A\}\vdash B} implies Δ ⊢ A → B {\displaystyle \Delta \vdash A\to B} . In the special case where Δ {\displaystyle \Delta } is the empty set, the deduction theorem claim can be more compactly written as: A ⊢ B {\displaystyle A\vdash B} implies ⊢ A → B {\displaystyle \vdash A\to B} . The deduction theorem for predicate logic is similar, but comes with some extra constraints (that would for example be satisfied if A {\displaystyle A} is a closed formula). In general a deduction theorem needs to take into account all logical details of the theory under consideration, so each logical system technically needs its own deduction theorem, although the differences are usually minor. The deduction...