Linked from

The 33 pages that link to Natural deduction, each with the reason it gives.

• First-order logicRelated: Its quantifier rules provide a direct way to prove first-order arguments.

• Deductive reasoningRelated: It represents deduction as a sequence of locally justified inference steps.

• Intuitionistic logicRelated: Its rules give intuitionistic logic a direct account of constructing and using proofs.

• Propositional logicRelated: Its rules formalize how each propositional connective can be introduced and used.

• Rule of inferenceRelated: Its rules organize proofs around how propositions are established and used.

• Logical consequenceRelated: Its derivations display how conclusions follow from temporary assumptions.

• Mathematical logicRelated: Its rules make the structure of formal reasoning explicit.

• Modus ponensRelated: Its conditional-elimination rule is modus ponens.

• Curry–Howard correspondenceRelated: Howard’s formulation matched its logical rules with typed lambda-calculus operations.

• Bound variableRelated: Quantifier rules impose conditions on variables used as temporary or arbitrary objects.

• LogicRelated: Its introduction and elimination rules formalize familiar patterns of reasoning.

• DemonstrationRelated: Its rule-by-rule derivations show exactly how premises yield a conclusion.

• Logical validityRelated: Its inference rules are designed to preserve validity at each proof step.

• Deductive systemRelated: Its rules organize proofs around assumptions and the logical operators in conclusions.

• Symbolic logicRelated: Its inference rules show how formal proofs derive conclusions from assumptions.

• Cut-elimination theoremRelated: Gentzen’s normalization theorem for natural deduction parallels cut elimination in sequent calculus.

• Peirce's lawRelated: Its intuitionistic form does not supply a derivation of Peirce's law.

• Formal fallacyRelated: Its rules make it possible to check whether a proposed inference preserves validity.

• Constructive dilemmaRelated: Constructive dilemma can be represented through ordinary disjunction and conditional reasoning in this proof framework.

• Deduction theoremRelated: Its conditional-introduction rule discharges an assumption to derive an implication.