sequent
Sign in to saveIn mathematical logic, a sequent is a very general kind of conditional assertion.
~14 min read
Encyclopedic overview
17 sectionsContents
- Introduction
- The form and semantics of sequents
- Syntax details
- Properties
- Effects of inserting and removing propositions
- Consequences of empty lists of formulas
- Examples
- Rules
- Interpretation
- History of the meaning of sequent assertions
- Intuitive meaning
- Variations
- Etymology
- See also
- Notes
- References
- External links
In mathematical logic, a sequent is a very general kind of conditional assertion. A_1,\,\dots,A_m \,\vdash\, B_1,\,\dots,B_n.
A sequent may have any number m of condition formulas Ai (called "antecedents") and any number n of asserted formulas Bj (called "succedents" or "consequents"). A sequent is understood to mean that if all of the antecedent conditions are true, then at least one of the consequent formulas is true. This style of conditional assertion is almost always associated with the conceptual framework of sequent calculus.
Excerpted from Wikipedia’s “sequent” article, available under the CC BY-SA 4.0 licence.