Linked from

The 28 pages that link to Sequent calculus, each with the reason it gives.

• First-order logicRelated: Its rules make first-order derivations systematic and support proofs of metatheorems.

• Truth tableCompared with: It proves consequences by symbolic rules rather than enumerating all truth assignments.

• Intuitionistic logicRelated: Intuitionistic sequent rules restrict conclusions in ways that preserve constructive proof.

• Rule of inferenceRelated: Its separate left and right rules make inference structure explicit.

• Natural deductionCompared with: Gentzen introduced it alongside natural deduction, using a different organization of inference rules.

• Logical consequenceRelated: Sequents make premise-to-conclusion consequence explicit in proof rules.

• Automated theorem provingRelated: Its structured inference rules provide a framework for proof search.

• Paraconsistent logicRelated: Inference rules make explicit which conclusions remain valid when premises conflict.

• Formal proofRelated: It organizes formal derivations around explicit judgments about assumptions and conclusions.

• Proof theoryBroader topic: Its explicit rules make proof structure and transformations especially visible.

• Mathematical logicRelated: It offers a distinct formal organization of proofs and supports analyses of their structure.

• Formal systemBroader topic: It offers a structured alternative for presenting derivations and proof structure.

• Formal logicBroader topic: Its rule-based proofs make logical structure and assumptions explicit.

• DerivationBroader topic: Its derivations show how assumptions support conclusions through rule applications.

• LogicRelated: It studies inference through transformations of sequents rather than assumption-led proofs.

• Axiomatic systemCompared with: It offers a different proof architecture for formalizing deduction.

• Deductive systemRelated: It makes structural properties of derivations explicit through sequent rules.

• Symbolic logicRelated: It offers a rule-based alternative for analyzing derivability and proof structure.

• Disjunction eliminationRelated: Its left-disjunction rule captures the same case split in a different proof format.

• Disjunction introductionRelated: Its right-disjunction rules formalize the same inference in a different proof framework.

• Cut-elimination theoremNarrower topic: Cut elimination is most commonly formulated as a transformation of sequent-calculus derivations.

• Biconditional introductionCompared with: It formalizes logical reasoning through sequent rules rather than the familiar natural-deduction pattern.

• Conjunction introductionRelated: Its right-conjunction rule expresses the same two-premise pattern in a different proof framework.

• Conjunction eliminationRelated: Its left rule for conjunction captures the same reasoning in a different proof format.

• Constructive dilemmaRelated: Its inference rules provide another precise setting for expressing the same entailment.

• Deduction theoremRelated: Its implication rules express a sequent form of assumption discharge.

• Consequentia mirabilisRelated: Sequent notation can state the rule as deriving P from the assumption not-P.

• Craig interpolationRelated: Cut elimination in sequent calculi provides a standard route to interpolation proofs.